Answer Set Programming Modulo Acyclicity-Reference-Cited by-同舟云学术

Answer Set Programming Modulo Acyclicity

Published:2015 Issue: Volume: Page:143-150
ISSN:0302-9743
Container-title:Logic Programming and Nonmonotonic Reasoning
language:
Short-container-title:

Author:

Bomanson Jori,Gebser Martin,Janhunen Tomi,Kaufmann Benjamin,Schaub Torsten

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-23264-5_13

Reference18 articles.

1. Cussens, J.: Bayesian network learning with cutting planes. In: Proceeding UAI 2011, pp. 153–160. AUAI Press (2011)

2. Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Proceeding NIPS 2013, NIPS Foundation, pp. 1349–1357 (2013)

3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);E Erdem,2000

4. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, pp. 825–885. IOS Press (2009)

5. Lecture Notes in Computer Science;M Gebser,2014

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hamiltonian Cycle Reconfiguration with Answer Set Programming;Logics in Artificial Intelligence;2023

2. Chinese Remainder Encoding for Hamiltonian Cycles;Theory and Applications of Satisfiability Testing – SAT 2021;2021

3. Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search;Fundamenta Informaticae;2020-12-18

4. In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem;Lecture Notes in Computer Science;2020

5. The External Interface for Extending WASP;Theory and Practice of Logic Programming;2018-12-10