Skip to main content
SpringerLink
Log in

Coherent Well-founded Annotated Logic Programs

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1730))

Abstract

Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programsin order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpreted by explicitly annotating atoms with elements of a new domain of truth values. In this paper coherent well-founded annotated programs are defined, and shown to generalize both consistent and paraconsistent extended programs, along with several classes of annotated programs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Adali and V. S. Subrahmanian. Amalgamating knowledge bases, III: Algorithms, data structures, and query processing. J. of Logic Programming, 28(1):45–88, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. J. Alferes and L. M. Pereira. Reasoning with Logic Programming. LNAI volume 1111, Springer-Verlag, 1996.

    Google Scholar 

  3. Carlos Viegas Damásio. Paraconsistent Extended Logic Programming with Constraints. PhD thesis, Universidade Nova de Lisboa, October 1996.

    Google Scholar 

  4. Carlos Viegas Damásio and Luís Moniz Pereira. A survey of paraconsistent semantics for logic programas. In D. Gabbay and P. Smets, editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, volume 2, pages 241–320. Kluwer, 1998.

    Google Scholar 

  5. A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. In International Conference on Logic Programming 1997, pages 391–495, 1997.

    Google Scholar 

  6. M. Van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733–742, 1976.

    Article  Google Scholar 

  7. J. Freire, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. XSB: A system for efficiently computing the well-founded semantics. In Fourth LPNMR, pages 430–440, 1997.

    Google Scholar 

  8. A. Van 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.

    Article  MATH  Google Scholar 

  9. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, 7th International Conference on Logic Programming, pages 579–597. MIT Press, 1990.

    Google Scholar 

  10. M. Kifer and E. Lozinskii. A logic for reasoning with inconsistency. J. of Automated Reasoning, 8:179–215, 1992.

    Article  MathSciNet  Google Scholar 

  11. M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. of Logic Programming, 12:335–367, 1992.

    Article  MathSciNet  Google Scholar 

  12. C. Sakama and K. Inoue. Paraconsistent Stable Semantics for Extended Disjunctive Programs. J. of Logic and Computation, 5(3):265–285, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. V. S. Subrahmanian. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19(2):291–331, 1994.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.I. Centre, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2825-114, Caparica, Portugal

    Carlos Viegas Damásio1

  2. A.I. Centre, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2825-114, Caparica, Portugal

    Luís Moniz Pereira

  3. Department of Computer Science, University of Maryland, College Park, MD, USA

    Terrance Swift

Authors
  1. Carlos Viegas Damásio1
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Moniz Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Terrance Swift
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79916, USA

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damásio1, C.V., Pereira, L.M., Swift, T. (1999). Coherent Well-founded Annotated Logic Programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation