Satisfiability Checking for PC(ID)-Reference-Cited by-同舟云学术

Satisfiability Checking for PC(ID)

Published:2005 Issue: Volume: Page:565-579
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Mariën Maarten,Mitra Rudradeb,Denecker Marc,Bruynooghe Maurice

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11591191_39.pdf

Reference29 articles.

1. Lecture Notes in Computer Science;K.A. Berman,1995

2. Brachman, R.J., Levesque, H.J.: Competence in knowledge representation. In: Proc. of the National Conference on Artificial Intelligence, pp. 189–192 (1982)

3. Davis, M., Longemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 394–397 (1962)

4. Lecture Notes in Artificial Intelligence;T. Dell’Armi,2001

5. Denecker, M.: Knowledge Representation and Reasoning in Incomplete Logic Programming. PhD thesis, Department of Computer Science, K.U.Leuven (1993)

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

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

2. Satisfiability Checking for PC(ID);Logic for Programming, Artificial Intelligence, and Reasoning;2005

3. Integrating Inductive Definitions in SAT;Logic for Programming, Artificial Intelligence, and Reasoning

4. A Deductive System for PC(ID);Logic Programming and Nonmonotonic Reasoning

5. Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions;Logic Programming and Nonmonotonic Reasoning