Tableaux for logic programming with strong negation

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

Volumn 1227, Issue , 1997, Pages 31-42

  Akama, Seiki ^a  

^a TEIKYO HEISEI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTER CIRCUITS; KNOWLEDGE REPRESENTATION; PATHOLOGY; RECONFIGURABLE HARDWARE;

NEGATIVE INFORMATION; STRONG NEGATIONS;

LOGIC PROGRAMMING;

EID: 33746085802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027403     Document Type: Conference Paper

References (26)

1. Akama, S. (1987): Resolution in constructivism, Logique et Analyse 120, 385399.
2. Akama, S. (1988a): On the proof method for constructive falsity, Zeitschrift für mathemaiische Logik und Grundlagen der Mathemaiik 34, 385-392.
3. Akama, S. (1988b): Constructive predicate logic with strong negation and model theory, Noire Dame Journal of Formal Logic 29, 18-27.
4. Akama, S. (1989): Constructive Falsity: Foundations and Their Applications to Computer Science, Ph.D. dissertation, Department of Administration Engineering, Keio University, Yokohama, Japan.
5. Akama, S. (1990): Subformula semantics for strong negation systems, The Journal of Philosophical Logic 19, 217-226.
6. Akama, S. (1995): Three-valued constructive logic and logic programs, Proc. of the IEEE 25th International Symposium on Multiple-Valued Logic, 276-281, Bloomington, USA, May.
7. Akama, S. (1996): Curry’s paradox in contractionless constructive logic, The Journal of Philosophical Logic 25, 135-150.
8. Alferes, J. J. and Pereira, L. M. (1996): Reasoning with Logic Programming, LNAI 1111, Springer, Berlin.
9. Almukdad, A. and Nelson, D. (1984): Constructible falsity and inexact predicates, The Journal of Symbolic Logic 49, 8-37, 231-233.
10. Clark, K. L. (1978): Negation as failure, H. Gallaire and J. Minker (eds.), Logic and Databases, 293-322, Plenum Press, New York.
11. Fitting, M. (1969): Intuitionistic Logic, Model Theory and Forcing, North- HoIIand, Amsterdam.
12. Gelfond, M. and Lifschitz, V. (1990): Logic programs with classical negation, D. H. D. Warren and P. Szeredi (eds.), Proc. of ICLP’90, 579-597, MIT Press, Cambridge, Mass.
13. Hahnle, R. (1993): Automated Deduction in Multiple-Valued Logics, Oxford University Press, Oxford.
14. Kowalski, R. and Sadri, F. (1990): Logic programs with exceptions, D. H. D. Warren and P. Szeredi (eds.), Proc. of ICLP’90, 598-613, MIT Press, Cambridge, Mass.
15. Miglioli, P., Moscato, U. and Ornaghi, M. (1994): An improved refutation system for intuitionistic predicate logic, Journal of Automated Reasoning 13, 361373.
16. Nelson, D. (1949): Constructible falsity, The Journal of Symbolic Logic 14, 1626.
17. Pearce, D. (1992): Default logic and constructive logic, Proc. of ECAI’92, 309-313.
18. Pearce, D. (1993): Answer sets and constructive logic Part II: Extended logic programs and related nonmonotonic formalisms, L. M. Pereira and A. Nerode (eds.), Logic Programming and Non-Monotonic Reasoning, Proc. of the 2nd International Workshop, 457-475, MIT Press, Cambridge, Mass.
19. Pearce, D. and Wagner, G. (1990): Reasoning with negative information I: Strong negation in logic programs, Acta Philosophica Fennica 49, 430-453.
20. Pearce, D. and Wagner, G. (1991): Logic programming with strong negation, P. Schroeder-Heister (ed.), Extensions in Logic Programming, 311-326, Springer, Berlin.
21. Rautenberg, W. (1979): Klassische and Nichtklassische Aussagenlogik, Vieweg, Wiesbaden.
22. Schoenfeld, W. (1985): PROLOG extensions based on tableau calculus, Proc. of IJCAI’85, 730-732.
23. Smullyan, R. (1968): First-Order Logic, Springer, Berlin.
24. Thomason, R. H. (1969): A semantical study of constructible falsity, Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15, 247-257.
25. Wagner, G. (1991): Logic programming with strong negation and inexact predicates, Journal of Logic and Computation 1, 835-859.
26. Wagner, G. (1992): Vivid Logic: Knoweldge-Based Reasoning with Two Kinds of Negation, Ph.D. dissertation, Freien Universitat Berlin.