Logic Programming with Graded Modality

DOI10.1007/978-3-319-23264-5_43zbMath1467.68030OpenAlexW2402570334MaRDI QIDQ3449234

Zhizheng Zhang, Shu Tao Zhang

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_43

zbMATH Keywords

logic programminggraded modalityanswer set

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic programming (68N17)

Related Items (2)

Evaluating epistemic negation in answer set programming ⋮ A parallel memory-efficient epistemic logic program solver: harder, better, faster

Cites Work

• Unnamed Item
• Unnamed Item
• Graded modalities. I
• Conflict-driven answer set solving: from theory to practice
• On the computational cost of disjunctive logic programming: Propositional case
• Logic programming and reasoning with incomplete information
• In so many possible worlds
• Revisiting Epistemic Specifications
• New Semantics for Epistemic Specifications
• The language of epistemic specifications (refined) including a prototype solver
• Design and implementation of aggregate functions in the DLV system
• Reconciling description logics and rules
• Probabilistic reasoning with answer sets

This page was built for publication: Logic Programming with Graded Modality