Logic programming and knowledge representation---The A-Prolog perspective

DOI10.1016/S0004-3702(02)00207-2zbMATH Open0995.68022OpenAlexW2043673291MaRDI QIDQ1603731FDOQ1603731

Authors: Michael Gelfond, N. Leone 

Publication date: 15 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00207-2

Recommendations

• Logic programming and knowledge representation
• Logic Programming and Nonmonotonic Reasoning
• scientific article; zbMATH DE number 2090558
• Logic Programming in Knowledge Domains

zbMATH Keywords

answer set programmingnonmonotonic reasoninglogic programmingdefault reasoning

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• A three-valued semantics for deductive databases and logic programs
• An abstract, argumentation-theoretic approach to default reasoning
• Extending and implementing the stable model semantics
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The well-founded semantics for general logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructible falsity
• Title not available (Why is that?)
• Answer set programming and plan generation
• Logic programs with stable model semantics as a constraint programming paradigm
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Representing action and change by logic programs
• Autoepistemic logic
• Representing actions in logic programs and default theories a situation calculus approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic programming and negation: A survey
• Title not available (Why is that?)
• A logic for default reasoning
• Non-monotonic logic. I
• Semantical considerations on nonmonotonic logic
• Circumscription - a form of non-monotonic reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• A kripke-kleene semantics for logic programs*
• Title not available (Why is that?)
• Census data repair: a challenging application of disjunctive logic programming
• Classifying the computational complexity of problems
• Prioritized logic programming and its application to commonsense reasoning
• Logic programming and knowledge representation
• Negation in logic programming
• Fixed-parameter complexity in AI and nonmonotonic reasoning
• Introduction to logic-based artificial intelligence
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reasoning agents in dynamic domains
• Nonmonotonic Logic II
• Declarative problem-solving using the DLV system
• A note on the stable model semantics for logic programs
• General logical databases and programs: Default logic semantics and stratification
• A rational reconstruction of nonmonotonic truth maintenance systems
• Completed logic programs and their consistency
• A procedural semantics for well-founded negation in logic programs
• Title not available (Why is that?)
• Negation by default and unstratifiable logic programs
• A Completeness Result for SLDNF-Resolution
• Efficient top-down computation of queries under the well-founded semantics
• Tabulated resolution for the well-founded semantics
• Closed-world databases and circumscription
• Logic Programming with Strong Negation and Inexact Predicates
• From here to there: Stable negation in logic programming
• Title not available (Why is that?)
• A comparative study of open default theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving termination of general Prolog programs
• Expressive power and complexity of partial models for disjunctive deductive databases
• Title not available (Why is that?)
• LUPS -- A language for updating logic programs
• Preference Logic Grammars: Fixed point semantics and application to data standardization
• Annotated revision programs
• Title not available (Why is that?)
• Completeness of SLDNF-resolution for nonfloundering queries
• Order-consistent programs are cautiously monotonic
• Title not available (Why is that?)

Cited In (51)

• Logic programming with infinite sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata and Answer Set Programming
• The Design of the Sixth Answer Set Programming Competition
• Relativized hyperequivalence of logic programs for modular programming
• Logic programs with abstract constraint atoms: the role of computations
• Answer Set Programming: A Primer
• Some (in)translatability results for normal logic programs and propositional theories
• Personal perspective on the development of logic programming based KR languages
• Knowledge graph embedding by logical-default attention graph convolution neural network for link prediction
• Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
• Answer set based design of knowledge systems
• Belief Base Change Operations for Answer Set Programming
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Title not available (Why is that?)
• The Seventh Answer Set Programming Competition: Design and Results
• Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
• Logic programming
• ASP for minimal entailment in a rational extension of SROEL
• Disjunctive logic programs, answer sets, and the cut rule
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Quo Vadis Answer Set Programming?
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Team-building with answer set programming in the Gioia-Tauro seaport
• A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
• Conflict-driven answer set solving: from theory to practice
• Logic Programming in Knowledge Domains
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• The Semantics of Consistency and Trust in Peer Data Exchange Systems
• Logic programming in the 1970s
• Parallel instantiation of ASP programs: techniques and experiments
• Set based logic programming
• An axiomatic analysis of structured argumentation with priorities
• Design and results of the Fifth Answer Set Programming Competition
• Justifications for logic programs under answer set semantics
• Logic programming with social features
• A new term representation method for prolog
• \textsc{Argonauts}: a working system for motivated cooperative agents
• System \(\text{Z}^{\text{FO}}\): default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases
• A logical approach to A-Prolog
• A system Z-like approach for first-order default reasoning
• A general approach to reasoning with probabilities
• Weight constraint programs with evaluable functions
• A solver for QBFs in negation normal form
• Handling and measuring inconsistency in non-monotonic logics
• Here and there among logics for logic programming
• Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
• Logic programming and knowledge representation
• Strong inconsistency
• Inconsistency measurement

Uses Software

• LUPS
• Smodels
• Datalog

This page was built for publication: Logic programming and knowledge representation---The A-Prolog perspective

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