Satisfiability for Propositional Contexts

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 369-376

  Serafini, Luciano ^a   Roelofsen, Floris ^a,b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CONTEXTUAL REASONING; DISTRIBUTION POLICIES; LOCAL REASONING; MULTI-CONTEXT SYSTEMS; REASONING PROCEDURES; SAT SOLVERS; SATISFIABILITY; SATISFIABILITY ALGORITHMS; SOUND AND COMPLETE; STATE OF THE ART;

FORMAL LOGIC;

EID: 85041811448     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Amir, E., and McIlraith, S. 2000. Partition-based logical reasoning. In Principles of Knowledge Representation and Reasoning (KR 00), 389-400.
2. Amir, E., and McIlraith, S. 2004. Partition-based logical reasoning for first-order and propositional theories. Artificial Intelligence. Accepted for publication. Preprint available at www.cs.berkeley.edu/∼ eyal/papers/oo-reason-general-aij2001.pdf.
3. Armando, A., and Giunchiglia, E. 1993. Embedding complex decision procedures inside an interactive theorem prover. Annals of Mathematics and Artificial Intelligence 8(3/4):475-502.
4. Bouquet, P., and Serafini, L. 2004. Comparing formal theories of context in AI. Artificial Intelligence. Accepted for publication.
5. Buvač, S., and Mason, I. A. 1993. Propositional logic of context. In National Conference on Artificial Intelligence (AAAI 93).
6. Cook, S. 1971. The complexity of theorem proving procedures. In ACM Symposium on the Theory of Computing, 151-158.
7. D'Agostino, M., and Mondadori, M. 1994. The taming of the cut: Classical refutations with analytic cut. Journal of Logic and Computation 4:285-319.
8. Davis, S.; Longemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Journal of the ACM 5(7):394-397.
9. Ghidini, C., and Giunchiglia, F. 2001. Local models semantics, or contextual reasoning = locality + compatibility. Artificial Intelligence 127(2):221-259.
10. Giunchiglia, F., and Sebastiani, R. 1996. A sat-based decision procedure for ALC. In Principles of Knowledge Representation and Reasoning (KR 96), 304-314.
11. Giunchiglia, F., and Sebastiani, R. 2000. Building decision procedures for modal logics from propositional decision procedures - the case study of modal k(m). Journal of Information and Computation 162(1/2):158-178.
12. Giunchiglia, F., and Serafini, L. 1994. Multilanguage hierarchical logics, or: how we can do without modal logics. Artificial Intelligence 65(1):29-70.
13. Giunchiglia, F. 1993a. Contextual reasoning. Epistemologia XVI:345-364.
14. Giunchiglia, F. 1993b. GETFOL: Interactive multicontext theorem proving (abstract). In Workshop on Automated Theorem Proving (IJCAI 93), 43-43.
15. Guha, R. 1991. Contexts: A Formalization and some Applications. Ph.D. Dissertation, Stanford University.
16. Massacci, F. 1996. Contextual reasoning is NP complete. In National Conference on Artificial Intelligence (AAAI 96), 621-626.
17. McCarthy, J., and Buvač, S. 1998. Formalizing context (expanded notes). In Computing Natural Language, volume 81 of CSLI Lecture Notes. 13-50.
18. McCarthy, J. 1987. Generality in artificial intelligence. Communications of ACM 30(12):1030-1035.
19. McCarthy, J. 1993. Notes on formalizing context. In International Joint Conference on Artificial Intelligence (IJCAI 93), 555-560.
20. Serafini, L., and Giunchiglia, F. 2002. Ml systems: A proof theory for contexts. Journal of Logic, Language and Information 11(4):471-518.
21. Weyhrauch, R. 1980. Prolegomena to a theory of mechanized formal reasoning. Artificial Intelligence 13(1):133-176.