Knowledge compilation for closed world reasoning and circumscription

Journal of Logic and Computation

Volumn 11, Issue 4, 2001, Pages 579-607

  Coste Marquis, Sylvie ^a   Marquis, Pierre ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Circumscription; Closed world reasoning; Knowledge compilation

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; EQUIVALENCE CLASSES; LOGIC PROGRAMMING;

CIRCUMSCRIPTION; CLOSED WORLD REASONING; KNOWLEDGE COMPILATION;

KNOWLEDGE BASED SYSTEMS;

EID: 0035416096     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/11.4.579     Document Type: Article

References (51)

1. Default reasoning using classical logic
2. Algorithms for propositional KB approximation
3. Tractable cover compilations
4. Semantical and computational aspects of Horn approximation
5. A survey on knowledge compilation
6. Preprocessing of intractable problems
7. Is intractability of non monotonic reasoning a real drawback?
8. Is intractability of non-monotonic reasoning a real drawback?
9. On compact representations of propositional circumscription
10. The complexity of propositional closed world reasoning and circumscription
11. Using the Davis and Putnam procedure for an efficient computation of preferred models
12. Complexity results for propositional closed world reasoning and circumscription from tractable knowledge bases
13. An improved incremental algorithm for generating prime implicates
14. Directional resolution: The Davis-Putnam procedure, revisited
15. Tractable databases: How to make propositional unit resolution complete through compilation
16. An analysis of approximate knowledge compilation
17. Linear time algorithms for testing the satisfiability of propositional Horn formulae
18. p-complete
19. Negation as failure: Careful closure procedure
20. On the relationship between circumscription and negation as failure
21. A circumscriptive theorem prover
22. Complexity results for nonmonotonic logics
23. Consequence-finding based on ordered linear resolution
24. Linear resolution in consequence-finding
25. On theorem provers for circumscription
26. Hard problems for simple default logic
27. Forming concepts for fast inference
28. Renaming a set of clauses as a Horn set
29. On the compilability of diagnosis, planning, reasoning about actions, belief revision, etc.
30. Computing circumscription
31. Knowledge compilation using theory prime implicates
32. Consequence finding algorithms
33. Circumscription: A form of non-monotonic reasoning
34. Applications of circumscription to formalizing common-sense knowledge
35. On indefinite databases and the closed world assumption
36. How hard is it to revise a belief base?
37. Computing circumscriptive databases. I: Theory and algorithms
38. An algorithm to compute circumscription
39. A minimality maintenance system
40. On closed world databases
41. Foundations of assumption-based truth maintenance systems: Preliminary report
42. Compilation for critically constrained knowledge bases
43. Knowledge compilation and theory approximation
44. The complexity of propositional default logics
45. Generalization of consensus theory and application to the minimization of Boolean functions
46. Deduction in non-Horn databases