Probable consistency checking for sets of propositional clauses

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2711, Issue , 2003, Pages 464-476

  Hunter, Anthony ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; SET THEORY; FORMAL LOGIC;

KNOWLEDGEBASES; POLYNOMIAL TIME TESTS; PROPOSITIONAL LOGIC; CLASSICAL PROPOSITIONAL LOGIC; CONSISTENCY CHECKING; LOGIC-BASED APPROACH; POLYNOMIAL-TIME; PRACTICAL REASONING;

KNOWLEDGE ENGINEERING; POLYNOMIAL APPROXIMATION;

EID: 8344258018     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45062-7_38     Document Type: Conference Paper

References (10)

1. A. Darwiche. Compiling knowledge into decomposible negation normal form. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'99), pages 284-289, 1999.
2. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1-38, 1987.
3. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
4. F. Koriche. On anytime coherence-based reasoning. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Ecsqaru'01), volume 2143 of Lecture Notes in Computer Science, pages 556-567. Springer, 2001.
5. H. Levesque. A logic of implicit and explicit belief. In Proceedings of the National Conference on Artificial Intelligence (AAAI'84), pages 198-202, 1984.
6. P. Marquis. Knowledge compilation using prime implicates. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'95), pages 837-843, 1995.
7. F. Oppacher and E. Suen. HARP: A tableau-based theorem prover. Journal of Automated Reasoning, 4:69-100, 1988.
8. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
9. M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74:249-310, 1995.
10. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92), pages 440-446, 1992.