Computing equilibrium models using signed formulas

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

Volumn 1861, Issue , 2000, Pages 688-702

  Pearce, David ^a   De Guzmán, Inmaculada P ^b   Valverde, Agustín ^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; ANSWER SET PROGRAMMING; AUTOMATED REASONING TOOLS; CLASSICAL LOGIC; COMPLEXITY RESULTS; COMPUTING EQUILIBRIA; CONSERVATIVE EXTENSIONS; DECISION PROBLEMS; DISJUNCTIVE LOGIC PROGRAMS; EQUILIBRIUM LOGIC; NESTED EXPRESSIONS; NON-CLASSICAL LOGIC; NON-MONOTONIC REASONING; PRACTICAL IMPLEMENTATION; PROOF SYSTEM; SIGNED FORMULAS; SMODELS; STRONG NEGATIONS; THEORETICAL BASIS;

MODEL CHECKING;

LOGIC PROGRAMMING;

EID: 84867777672     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_46     Document Type: Conference Paper

References (32)

1. Aguilera, G, P. De Guzm-An, I, Ojeda-Aciego, M and Valverde, A. Reductions for non-clausal theorem proving. Theoretical Computer Science (2000). To appear.
2. Alferes, J J, Leite, J A, Pereira, L M, Przymusinska, H, and Przymusinski, T C, Dynamic Logic Programming, in A. Cohn, L. Schubert and S. Shapiro (eds.), Procs. KR'98, Morgan Kaufmann,1998.
3. Egly, U, Eiter, T, Tompits, H and Woltran, S, Implementing Default reasoning Using Quanti-ed Boolean Formulae (System Description), in F Bry, U Geske and D Sepiel (eds), Proc Workshop Logische Programmierung, GMD Report 90, Jan 2000.
4. Eiter, T, Leone N, Mateis, C, Pfeifer, G and Scarcello, F, A Deductive System for Nonmonotonic Reasoning, in Proc. LPNMR97, Springer, 1997.
5. Eiter, T, Leone N, Mateis, C, Pfeifer, G and Scarcello, F, The KR System dlv: Progress Report, Comparisons and Benchmarks, in Proc. KR98, Morgan Kaufmann, 1998
6. Gelfond, M, and Lifschitz, V, The Stable Model Semantics for Logic Programs, in K Bowen and R Kowalski (eds), Proc 5th ICLP, MIT Press, 1070-1080.
7. Gelfond, M and Lifschitz, V, Logic Programs with Classical Nega tion, in D Warren and P Szeredi (eds), Proc ICLP-90, MIT Press, 1990, 579-597.
8. Gelfond M,Lifschitz, V Classical Negation in Logic Programs and Disjunctive Databases New Generation Computing 1991, 365-387.
9. Greco, S, Leone, N, Scarcello, F, DATALOG with Nested Rules, in Proc. (LPKR '97), Port Je-erson, New York, LNAI 1471, pp. 52-65, Springer, 1998.
10. . Gurevich, Y, Intuitionistic Logic with Strong Negation, Studia Logica 36 (1977
11. P. De Guzman, I., Ojeda-Aciego, M. and Valverde, A. Multiple-Valued Tableaux with reductions. In Proc IC-AI'1999, pp 177-183, Las Vegas, Nevada, USA.
12. Hähnle, R. Towards an efficient tableau proof procedure for multiple-valued logics. In E Börger, H Kleine Büning, M M Richter, andWSchönfeld, eds, Selected Papers fro m CSL'90, Heidelberg,Germany, LNCS 533, pp. 248-260. Springer-Verlag, 1991.
13. Hähnle, R. Automated Deduction in Multiple-valued Logics. Oxford UP, 1993.
14. Kracht, M, On E xtensions of Intermediate Logics by Strong Negation, J Philosophical Logic 27 (1998
15. Lifschitz,V, Foundations of Logic Programming, in G Brewka (ed), Principles of Knowledge Representation, CSLI Publications, 1996.
16. Lifschitz, V, Tang, L R and Turner, H, Nested Expressions in Logic Programs, to appear in Annals of Mathematics and Artificial Intelligence.
17. Lukasiewicz, J, Die Logik und das Grundlagenproblem, in Les Entreties de Zürich sur les Fondaments et la M-ethode des Sciences Math-ematiques 6-9, 12 (1938
18. Maksimova, L, Craig's interpolation theorem and amalgamable varieties, Doklady Akademii Nauk SSSR, 237, no. 6, (1977), pp. 1281-1284.
19. Murray, N V and Rosenthal, E. Impro ving tableau deductions in multiple-valued logics. In Proc 21st ISMVL, pp. 230-237, Victoria, May 1991. IEEE Press.
20. Murray, N V and Rosenthal, E. Adapting classical inference techniques to multiplevalued logics using signed formulas. Fundamenta Informaticae, 21(3), 1994
21. Nelson, D, Constructible Falsity, J Symbolic Logic 14 (1949), 16-26.
22. Niemelä, I and Simons, P, Smodels-An Implementation of the Stable Model and Well-founded Semantics, Proc LPNMR 97, Springer, 420-29.
23. Ojeda, M, P. De Guzm-An, I, Aguilera, G and Valverde, A. Reducing signed propositional formulas. Soft Computing, vol. 2(4):157-166, 1998.
24. Pearce, D, A New Logical Characterisation of Stable Models and Answer Sets, in J Dix, L M Pereira, and T Przymusinski (eds), Non-monotonic Extensions of Logic Programming. Proc NMELP Springer, LNAI 1216, 1997.
25. Pearce, D, From Here to T here: Stable Negation in Logic Programming, in D Gabbay and H Wansing (eds), What is Negation?, Kluwer, 1999.
26. Pearce, D, P. De Guzm-An, I, and Valverde, A, A Tableau System for Equilibrium Entailment, Proc TABLEAUX 2000 (To appear
27. Simons, P, Extending the Stable Model Semantics with more Expressive Rules, in M Gelfond, N Leone and G Pfeifer (eds), Proc. LPNMR'99, LNAI 1730, Springer.
28. Smetanich Ya S On Completeness of a Propositional Calculus with an additional Operation of One Variable (in Russian). Trudy Moscovskogo matrmaticheskogo obshchestva 9, 1960, 357-372.
29. V alverde, A.-Arboles de implicantes e implicados y reducciones de l-ogicas signadas en ATPs. PhD thesis, Universidad de M-Alaga, Espa~na, July 1998.
30. Vorob'ev, N N, A Constructive Propositional Calculus with Strong Negation (in Russian), Doklady Akademii Nauk SSR 85 (1952), 465-468.
31. Vorob'ev, N N, The Problem of Deducibility in Constructive Propositional Calculus with Strong Negation (in Russian), Doklady Akademii Nauk SSR 85 (1952
32. W-ojcicki, R, Theory of Logical Calculi, Kluwer, 1988.