A tableau calculus for equilibrium entailment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1847 LNAI, Issue , 2000, Pages 352-367

  Pearce, David ^a   De Guzmán, Inmaculada P ^b   Valverde, Agusíin ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET SEMANTICS; CLASSICAL LOGIC; COMPUTING EQUILIBRIA; EQUILIBRIUM LOGIC; GENERALISATION; LOGIC PROGRAMS; NON-CLASSICAL LOGIC; STRONG NEGATIONS; TABLEAU METHOD;

BIOMINERALIZATION; LOGIC PROGRAMMING; SEMANTICS;

CALCULATIONS;

EID: 84886033221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_28     Document Type: Conference Paper

References (36)

1. Bonatti, P A, Sequent calculi for default and autoepistemic logics, in P Miglioli, U Moscato, D Mundici & M Ornaghi (eds), Proc. Tableaux'96, LNAI 1071, pages 107-121, Springer, 1996.
2. Bonatti, P A, & Olivetti, N, A sequent calculi for skeptical default logic, in D Galmiche (ed) Proc. Tableaux'97, LNAI 1227, pages 127-142, Springer, 1997.
3. Brass, S, & Dix, J, Characterizations of the Disjunctive Stable Semantics by Partial Evaluation, J Logic Programming 32(3) (1997), pages 207-228.
4. Chagrov, A, & Zakharyaschev, M, Modal Logic, Oxford: Clarendon Press, 1997.
5. van Dalen, D, Intuitionistic Logic, in D Gabbay, & F Guenthner (eds), Handbook of Philosophical Logic, Vol. III, pages 225-340, Kluwer, Dordrecht, 1986.
6. Gelfond, M, & Lifschitz, V, The Stable Model Semantics for Logic Programs, in K Bowen & R Kowalski (eds), Proc 5th Int Conf on Logic Programming 2, MIT Press, pages 1070-1080, 1988.
7. Gelfond, M & Lifschitz, V, Logic Programs with Classical Negation, in D Warren & P Szeredi (eds), Proc ICLP-90, MIT Press, pages 579-597, 1990.
8. Gelfond, M, & Lifschitz, V, Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing (1991), pages 365-387.
9. Gödel, K, Zum intuitionistischen Aussagenkalkül, Anzeiger der Akademie der Wissenschaften in Wien 69, pages 65-66, 1932.
10. Gurevich, Y, Intuitionistic Logic with Strong Negation, Studia Logica 36 (1977), pages 49-59.
11. P. de Guzmán, I, Ojeda & Valverde, A. Multiple-Valued Tableaux with δ-reductions. In Proceedings of IC-AI'99, pages 177-183. CSREA Press.
12. Hähnle, R Towards an efficient tableau proof procedure for multiple-valued logics. In Egon Börger, Hans Kleine Büning, Michael M. Richter, and Wolfgang Schönfeld, editors, Selected Papers from Computer Science Logic, CSL'90, Heidelberg, Germany, volume 533 of Lectures Notes in Computer Science, pages 248-260. Springer-Verlag, 1991.
13. Hähnle, R. Automated Deduction in Multiple-valued Logics. Oxford University Press, 1993.
14. Heyting, A, Die formalen Regeln der intuitionistischen Logik, Sitzung Preuss. Akad. Wiss. Phys. Math. Kl, pages 42-56, 1930.
15. Inoue, K, Koshimura, M, & Hasegawa, R, Embedding negation as failure into a model generation theorem prover, in D Kapur (ed), Automated Deduction - Proc. CADE-11, LNAI 607, pages 400-415. Springer, 1992.
16. Kracht, M, On Extensions of Intermediate Logics by Strong Negation, J Philosophical Logic 27, pages 49-73, 1998.
17. Leone, N, Rullo, P & Scarcello, F, Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation, Information and Computation, 135 (2), 1997, pages 69-112.
18. Lifschitz, V, Tang, L R, and Turner, H, Nested expressions in logic programs, Annals of Mathematics and Artificial Intelligence, to appear.
19. Łukasiewicz, J, Die Logik und das Grundlagenproblem, in Les Entreties de Zürich sur les Fondaments et la Méthode des Sciences Mathématiques 6-9, 12 (1938), Zürich, pages 82-100, 1941.
20. Maksimova, L, Craig's interpolation theorem and amalgamable varieties, Doklady Akademii Nauk SSSR, 237, no. 6, (1977), pages 1281-1284 (translated as Soviet Math. Doklady).
21. Nelson, D, Constructible Falsity, J Symbolic Logic 14 (1949), pages 16-26.
22. Niemelä, I, A tableau calculus for minimal model reasoning, in P Miglioli et al (eds), Theorem Proving with Analytic Tableaux and Related Methods, pages 278-294. Springer LNAI 1071, 1996.
23. Niemelä, I, Implementing Circumscription Using a Tableau Method, in Proc European Conference on Artificial Intelligence, ECAI 96, pages 80-84. John Wiley, 1996.
24. Niemelä, I, & Simons, P, Efficient Implementation of the Well-founded and Stable Model Semantics, Proc JICSLP 96, pages 289-303. MIT Press, 1996.
25. Ojeda, M, P. de Guzmán, I, Aguilera, G, and Valverde, A. Reducing signed propositional formulas. Soft Computing, vol. 2(4), pages 157-166, 1998.
26. Olivetti, N, A tableau and sequent calculus for minimal entailment, J Automated Reasoning 9, pages 99-139, 1992.
27. Olivetti, N, Tableaux for nonmonotonic logics, in M D'Agostino, D M Gabbay, R Hähnle, J Posegga (eds), Handbook of Tableau Methods, Kluwer, 1999.
28. Pearce, D, A New Logical Characterisation of Stable Models and Answer Sets, in J Dix, L M Pereira, & T Przymusinski (eds), Non-monotonic Extensions of Logic Programming. Proc NMELP 96. Springer, LNAI 1216, pages 57-70, 1997.
29. Pearce, D, From Here to There: Stable Negation in Logic Programming, in D Gabbay & H Wansing (eds), What is Negation?. Kluwer, pages 161-181, 1999.
30. Przymusinski, T, Stable Semantics for Disjunctive Programs, New Generation Computing 9, pages 401-424, 1991.
31. Rautenberg, W, Klassische und Nichtklassische Aussagenlogik, Vieweg, 1979.
32. Smetanich, Ya, S, On Completeness of a Propositional Calculus with an additional Operation of One Variable (in Russian). Trudy Moscovskogo matrmaticheskogo obshchestva, 9, pages 357-372, 1960.
33. Stuber, J, Computing stable models by program transformation, in P Van Hentenryck (ed), Proc. ICLP 94, pages 58-73. MIT Press, 1994.
34. Valverde, A, δ-Árboles de implicantes e implicados y reducciones de lógicas signadas en ATPs. PhD thesis, University of Málaga, Spain, July 1998.
35. Vorob'ev, N N, A Constructive Propositional Calculus with Strong Negation (in Russian), Doklady Akademii Nauk SSR 85 (1952), 465-468.
36. Vorob'ev, N N, The Problem of Deducibility in Constructive Propositional Calculus with Strong Negation (in Russian), Doklady Akademii Nauk SSR 85 (1952), 689-692.