paper-with-me

Papers

Implementing Default and Autoepistemic Logics via the Logic of GK

2014-05-05 · Jianmin Ji, Hannes Strass

The logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning. To date, it has been used to embed in it default logic (propositional case), autoepistemic logic, Turner's logic of universal causation, and general logic programming under stable model semantics. Besides showing the generality of GK as a logic for nonmonotonic reasoning, these embeddings shed light on the relationships among these other logics. In this paper, for the first time, we show how the logic of GK can be embedded into disjunctive logic programming in a polynomial but non-modular translation with new variables. The result can then be used to compute the extension/expansion semantics of default logic, autoepistemic logic and Turner's logic of universal causation by disjunctive ASP solvers such as claspD(-2), DLV, GNT and cmodels.

📄 PDF Abstract BibTeX arXiv:1405.0809

Code (0)

등록된 구현이 없습니다.

Tasks

Translation

Similar Papers 제목 키워드 기반

Applications of Intuitionistic Temporal Logic to Temporal Answer Set Programming

2026-03-16 · Pedro Cabalar, Martín Diéguez, David Fernández-Duque, François Laferrière 외 arxiv

The relationship between intuitionistic or intermediate logics and logic programming has been extensively studied, prominently featuring Pearce's equilibrium logic and Osorio's safe beliefs. Equilibrium logic admits a fi…

Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming

2022-11-30 · Jesse Heyninck, Ofer Arieli, Bart Bogaerts

Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonotonic…

The Complexity of Circumscription in DLs

2014-01-15 · Piero A. Bonatti, Carsten Lutz, Frank Wolter

As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such featu…

The informal semantics of Answer Set Programming: A Tarskian perspective

2019-01-26 · Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens

In Knowledge Representation, it is crucial that knowledge engineers have a good understanding of the formal expressions that they write. What formal expressions state intuitively about the domain of discourse is studied …

Pearce's Characterisation in an Epistemic Domain

2025-02-13 · Ezgi Iraz Su

Answer-set programming (ASP) is a successful problem-solving approach in logic-based AI. In ASP, problems are represented as declarative logic programs, and solutions are identified through their answer sets. Equilibrium…