A logic programming system for nonmonotonic reasoning

DOI10.1007/BF00883931MaRDI QIDQ1891266zbMATH OpenOpenAlexDBLPWikidataFDO

Authors José Júlio Alferes, Carlos Viegas Damásio, Luís Moniz Pereira

Publication date 27 August 1995

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00883931

zbMATH Keywords

logic programming semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic programming (68N17) Knowledge representation (68T30)

Recommendations

• Non-monotonic reasoning with logic programming
• scientific article; zbMATH DE number 4128792
• Paraconsistent declarative semantics for extended logic programs
• scientific article; zbMATH DE number 4180779
• `Classical' negation in nonmonotonic reasoning and logic programming

Cites work

• A basis for deductive database systems
• A procedural semantics for well-founded negation in logic programs
• Belief, provability, and logic programs
• Declarative error diagnosis
• scientific article; zbMATH DE number 4106291 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 140403 (Why is no real title available?)
• scientific article; zbMATH DE number 517010 (Why is no real title available?)
• scientific article; zbMATH DE number 9973 (Why is no real title available?)
• Knowledge in flux. Modeling the dynamics of epistemic states
• Linear resolution with selection function
• Logic programming and knowledge representation
• Logic programming and negation: A survey
• Logic Programming with Strong Negation and Inexact Predicates
• Negation in logic programming
• Nonmonotonic reasoning, preferential models and cumulative logics
• One difference method of solving a linear differential equation with a discontinuous coefficient. I
• SLDNFA: An abductive procedure for abductive logic programs
• Static semantics for normal and disjunctive logic programs
• Tabulated resolution for the well-founded semantics
• The well-founded semantics for general logic programs
• WELL!: An evaluation procedure for all logic programs

Cited in

(17)

• Formalizing nonmonotonic reasoning systems
• A unifying view for logic programming with non-monotonic reasoning
• An encompassing framework for paraconsistent logic programs
• Relating defeasible and normal logic programming through transformation properties.
• Belief revision via Lamarckian evolution
• Epistemology and artificial intelligence
• Systems and Implementations for Solving Reasoning Problems in Conditional Logics
• Towards the integration of inductive and nonmonotonic logic programming
• Extending Prolog with nonmonotonic reasoning
• A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
• Non-monotonic reasoning with logic programming
• Inverse entailment in nonmonotonic logic programs
• A rewriting method for well-founded semantics with explicit negation
• The limits of fixed-order computation
• Prolegomena to logic programming for non-monotonic reasoning
• Update-programms can update programs
• d-\( \mathcal{B} \): a language for well-founded deontic planning

This page was built for publication: A logic programming system for nonmonotonic reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891266)