This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. J. Alferes. Semantics of Logic Programs with Explicit Negation. PhD thesis, Universidade Nova de Lisboa, October 1993.
J. J. Alferes, C. V. Damásio, and L. M. Pereira. A top-down derivation procedure for programs with explicit negation. In M. Bruynooghe, editor, ILPS'94, pages 424–438. MIT Press, 1994.
J. J. Alferes, C. V. Damásio, and L. M. Pereira. A logic programming system for non-monotonic reasoning. Special Issue of the JAR, 1995. To appear.
J. J. Alferes and L. M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, IJCSLP'92, pages 574–588. MIT Press, 1992.
J. J. Alferes and L. M. Pereira. Contradiction: when avoidance equal removal. In R. Dyckhoff, editor, 4th Int. Ws. on Extensions of LP, volume 798 of LNAI. Springer-Verlag, 1994.
C. Baral and M. Gelfond. Logic programming and knowledge representation. J. Logic Programming, 19/20:73–148, 1994.
H. A. Blair and V. S. Subrahmanian. Paraconsistent logic programming. Theoretical Computer Science, 68:135–154, 1989.
A. Bondarenko, F. Toni, and R. Kowalski. An assumption-based framework for nonmonotonic reasoning. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on LP & NMR, pages 171–189. MIT Press, 1993.
K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.
M. Denecker and D. D. Schreye. SLDNFA: an abductive procedure for normal abductive programs. In K. Apt, editor, IJCSLP'92, pages 686–700. MIT Press.
P. M. Dung. Negation as hypotheses: An abductive framework for logic programming. In K. Furukawa, editor, 8th Int. Conf. on LP, pages 3–17. MIT Press, 1991.
K. Eshghi and R. Kowalski. Abduction compared with negation by failure. In 6th Int. Conf. on LP. MIT Press, 1989.
A. V. Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. A. Bowen, editors, ICLP'88, pages 1070–1080. MIT Press.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, 7th Int. Conf. on LP, pages 579–597. MIT Press, 1990.
M. Gelfond and V. Lifschitz. Representing actions in extended logic programs. In K. Apt, editor, IJCSLP'92, pages 559–573. MIT Press, 1992.
A. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2:719–770, 1993.
A. C. Kakas and P. Mancarella. Generalized stable models: A semantics for abduction. In Proc. ECAI'90, pages 401–405, 1990.
J. Lloyd and R. Topor. A basis for deductive database systems. Journal of Logic Programming, 2:93–109, 1985.
L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, ECAI'92, pages 102–106. Wiley, 1992.
L. M. Pereira, J. J. Alferes, and J. N. Aparício. Contradiction Removal within Well Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, LP & NMR, pages 105–119. MIT Press, 1991.
L. M. Pereira, J. N. Aparício, and J. J. Alferes. Non-monotonic reasoning with logic programming. Journal of Logic Programming. Special issue on Nonmonotonic reasoning, 17(2, 3 & 4):227–263, 1993.
L. M. Pereira, C. Damásio, and J. J. Alferes. Diagnosis and debugging as contradiction removal. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on LP & NMR, pages 316–330. MIT Press, 1993.
T. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Warren and Szeredi, editors, ICLP'90, pages 459–477. MIT Press, 1990.
R. Reiter. On closed-world data bases. In H. Gallaire and J. Minker, editors, Logic and DataBases, pages 55–76. Plenum Press, 1978.
R. Reiter. Towards a logical reconstruction of relational database theory. In M. Brodie and J. Mylopoulos, editors, On Conceptual Modelling, pages 191–233. Springer-Verlag, 1984.
C. Sakama. Extended well-founded semantics for paraconsistent logic programs. In Fifth Generation Computer Systems, pages 592–599. ICOT, 1992.
F. Teusink. A proof procedure for extended logic programs. In Proc. ILPS'93. MIT Press, 1993.
G. Wagner. Logic programming with strong negation and innexact predicates. J. of Logic and Computation, 1(6):835–861, 1991.
G. Wagner. Neutralization and preeemption in extended logic programs. Technical report, Freien Universitat Berlin, 1993.
M. Winslett. Reasoning about action using a possible model approach. In 7th AAAI, pages 89–93, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damásio, C.V., Pereira, L.M. (1995). Abduction over 3-valued extended logic programs. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-59487-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59487-1
Online ISBN: 978-3-540-49282-5
eBook Packages: Springer Book Archive