An argumentation-theoretic foundation for logic programming
From MaRDI portal
Publication:4327844
DOI10.1016/0743-1066(95)94697-XzbMath0816.68045MaRDI QIDQ4327844
Publication date: 9 April 1995
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items
Abduction in logic programming: A new definition and an abductive procedure based on rewriting, An abstract argumentation and logic programming comparison based on 5-valued labellings, Argumentation-Based Semantics for Logic Programs with First-Order Formulae, Knowledge base dynamics, abduction, and database updates, Argumentation in disjunctive logic programming, A unifying view for logic programming with non-monotonic reasoning, Justifying answer sets using argumentation, Solving stable matching problems using answer set programming, Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments, Dialectic proof procedures for assumption-based, admissible argumentation, Principles Of Talmudic Logic, Iterative belief revision in extended logic programming, Stabilization of Information Sharing for Queries Answering in Multiagent Systems, Cost-bounded argumentation, Modal provability foundations for argumentation networks, Semantics for a theory of defeasible reasoning, A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, Diversity of agents and their interaction, Probabilistic abstract argumentation frameworks, a possible world view, An abductive framework for negation in disjunctive logic programming, Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction, Modelling last-act attempted crime in criminal law
