Prolegomena to logic programming for non-monotonic reasoning

DOI10.1007/BFB0023799zbMATH Open1547.68086MaRDI QIDQ6623791

J. Dix, Teodor C. Przymusinski, Luís Moniz Pereira

Publication date: 24 October 2024

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing minimal models by partial instantiation
• Semantical considerations on nonmonotonic logic
• Inferring negative information from disjunctive databases
• A logic for default reasoning
• Computing definite logic programs by partial instantiation
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• On the declarative and procedural semantics of logic programs
• A logic programming system for nonmonotonic reasoning
• Logic programming and nonmonotonic reasoning. Third international conference, LPNMR '95, Lexington, KY, USA, June 26--28, 1995. Proceedings
• Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
• Static semantics for normal and disjunctive logic programs
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Linear resolution with selection function
• Bottom-up computation of perfect models for disjunctive theories
• A basis for deductive database systems
• A kripke-kleene semantics for logic programs*
• A basis for deductive database systems II
• Negation in logic programming
• Negation as failure using tight derivations for general logic programs
• A procedural semantics for well-founded negation in logic programs
• The Semantics of Predicate Logic as a Programming Language
• Algorithm = logic + control
• An overview of nonmonotonic reasoning and logic programming
• Non-monotonic reasoning with logic programming
• A goal-oriented approach to computing the well-founded semantics
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Tabled evaluation with delaying for general logic programs
• Model elimination without contrapositives
• Hyper tableaux
• Characterizing D-WFS: Confluence and iterated GCWA
• Constructible falsity

This page was built for publication: Prolegomena to logic programming for non-monotonic reasoning

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