Logic programming and knowledge representation
From MaRDI portal
Publication:4305625
DOI10.1016/0743-1066(94)90025-6zbMath0820.68028DBLPjournals/jlp/BaralG94OpenAlexW2090798572WikidataQ56050613 ScholiaQ56050613MaRDI QIDQ4305625
Michael Gelfond, Chitta R. Baral
Publication date: 15 August 1995
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(94)90025-6
Related Items (44)
On elementary loops of logic programs ⋮ A logic programming system for nonmonotonic reasoning ⋮ Collaborative vs. Conflicting Learning, Evolution and Argumentation ⋮ Answer set based design of knowledge systems ⋮ Possibilistic uncertainty handling for answer set programming ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Disjunctive logic and semantics of disjunctive logic programs ⋮ A Measure of Arbitrariness in Abductive Explanations ⋮ On the relationship between fuzzy autoepistemic logic and fuzzy modal logics of belief ⋮ Dealing with explicit preferences and uncertainty in answer set programming ⋮ Abduction from logic programs: Semantics and complexity ⋮ A unifying view for logic programming with non-monotonic reasoning ⋮ Complexity results for abductive logic programming ⋮ Abduction over 3-valued extended logic programs ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ On look-ahead heuristics in disjunctive logic programming ⋮ An axiomatic analysis of structured argumentation with priorities ⋮ On combining ontologies and rules ⋮ An application of answer set programming to the field of second language acquisition ⋮ A metamodel of access control for distributed environments: applications and properties ⋮ Making sense of sensory input ⋮ Paracoherent answer set computation ⋮ An infinite-game semantics for well-founded negation in logic programming ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Ordering default theories and nonmonotonic logic programs ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ A rule based knowledge transaction model for mobile environments ⋮ Probabilistic reasoning with answer sets ⋮ EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface ⋮ Autoepistemic equilibrium logic and epistemic specifications ⋮ Formalizing narratives using nested circumscription ⋮ Computing ideal sceptical argumentation ⋮ Indefinite abductive explanations ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Abductive reasoning through filtering ⋮ Prioritized logic programming and its application to commonsense reasoning ⋮ Answer sets and qualitative decision making ⋮ Clausal logic and logic programming in algebraic domains ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Fuzzy autoepistemic logic and its relation to fuzzy answer set programming ⋮ Enhancing disjunctive logic programming systems by SAT checkers ⋮ A causal approach to nonmonotonic reasoning
This page was built for publication: Logic programming and knowledge representation
