About epistemic negation and world views in epistemic logic programs

DOI10.1017/S147106841900019XMaRDI QIDQ5108503zbMATH OpenWikidataFDO

Authors Stefania Constantini

Publication date 4 May 2020

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.09867

zbMATH Keywords

answer set programmingepistemic logic programsepistemic negation

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17)

Abstract: In this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with "epistemic operators" and "epistemic negation", and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on the existence and number of world views. We show how to exploit an extended ASP semantics in order to: (i) provide a characterization of world views, different from existing ones; (ii) query world views and query the whole set of world views.

Recommendations

• Evaluating epistemic negation in answer set programming
• Autoepistemic answer set programming
• Founded world views with autoepistemic equilibrium logic
• Logic Programming and Nonmonotonic Reasoning
• An epistemic model of logic programming

Cites work

• A goal-oriented approach to computing the well-founded semantics
• A monotonic view on reflexive autoepistemic reasoning
• A survey of programming languages and platforms for multi-agent systems
• Epistemic answer set programming
• Evaluating epistemic negation in answer set programming
• Extremal problems in logic programming and stable model computation
• Founded world views with autoepistemic equilibrium logic
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 741347 (Why is no real title available?)
• Negation as a resource: a novel view on answer set semantics
• New semantics for epistemic specifications
• Normal forms for answer sets programming
• Query answering in resource-based answer set semantics
• Revisiting Epistemic Specifications
• selp: a single-shot epistemic logic program solver
• Semantics and complexity of recursive aggregates in answer set programming
• Splitting epistemic logic programs
• The well-founded semantics for general logic programs
• Transformation-based bottom-up computation of the well-founded model
• XSB: extending Prolog with tabled logic programming

Cited in

(14)

• Autoepistemic answer set programming
• Epistemic answer set programming
• Autoepistemic equilibrium logic and epistemic specifications
• Splitting epistemic logic programs
• Founded world views with autoepistemic equilibrium logic
• Epistemic logic programs: a study of some properties
• Evaluating epistemic negation in answer set programming
• selp: a single-shot epistemic logic program solver
• Utilizing treewidth for quantitative reasoning on epistemic logic programs
• Epistemic logic programs: a different world view
• scientific article; zbMATH DE number 7455722 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Epistemic logic programs: a study of some properties
• An epistemic model of logic programming

Describes a project that uses

Uses Software

• selp
• XSB

This page was built for publication: About epistemic negation and world views in epistemic logic programs

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