Propositional Satisfiability in Answer-Set Programming-Reference-Cited by-同舟云学术

Propositional Satisfiability in Answer-Set Programming

Published:2001 Issue: Volume: Page:138-153
ISSN:0302-9743
Container-title:KI 2001: Advances in Artificial Intelligence
language:
Short-container-title:

Author:

East Deborah,Truszczyński Mirosłlaw

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45422-5_11

Reference17 articles.

1. K. Apt. Logic programming. In J. van Leeuven, editor, Handbook of theoretical computer science, pages 493–574. Elsevier, Amsterdam, 1990.

2. R.J. Bayardo, Jr and R.C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97). MIT Press, 1997.

3. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and data bases, pages 293–322. Plenum Press, New York-London, 1978.

4. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. AKR system dlv: Progress report, comparisons and benchmarks. In Proceeding of the Sixth International Conference on Knowledge Representation and Reasoning (KR’ 98), pages 406–417. Morgan Kaufmann, 1998.

5. M.R. Garey and D.S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco, Calif., 1979.

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

1. Aggregating multi-valued CP-nets: a CSP-based approach;Journal of Heuristics;2014-12-30

2. Constraint Propagation for First-Order Logic and Inductive Definitions;ACM Transactions on Computational Logic;2013-08

3. Cardinality Constraint Programs;Logics in Artificial Intelligence;2004

4. Satisfiability and Computing van der Waerden Numbers;Theory and Applications of Satisfiability Testing;2004

5. WSAT(CC) — A Fast Local-Search ASP Solver;Logic Programming and Nonmonotonic Reasoning;2003