Possibilistic nested logic programs and strong equivalence

DOI10.1016/J.IJAR.2015.01.004MaRDI QIDQ2344722zbMATH OpenOpenAlexFDO

Authors Juan Carlos Nieves, Helena Lindgren

Publication date 18 May 2015

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2015.01.004

zbMATH Keywords

answer set programminguncertain informationpossibilistic reasoning

Mathematics Subject Classification ID

Medical applications (general) (92C50) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Recommendations

• Possibilistic nested logic programs
• Strong equivalence made easy: nested expressions and weight constraints
• scientific article; zbMATH DE number 1884383
• Nested expressions in logic programs
• Logic Programming and Nonmonotonic Reasoning

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• scientific article; zbMATH DE number 1531964 (Why is no real title available?)
• scientific article; zbMATH DE number 1884384 (Why is no real title available?)
• scientific article; zbMATH DE number 2090542 (Why is no real title available?)
• A core language for fuzzy answer set programming
• A logic programming framework for possibilistic argumentation: Formalization and logical properties
• An axiomatizable logical foundation for lattice-ordered qualitative linguistic approach for reasoning with words
• An introduction to fuzzy answer set programming
• Answer sets for consistent query answering in inconsistent databases
• Applications of intuitionistic logic in Answer Set Programming
• Bilattices and the semantics of logic programming
• Characterizing and extending answer set semantics using possibility theory
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Dealing with explicit preferences and uncertainty in answer set programming
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic and structure.
• Nested expressions in logic programs
• Nested preferences in answer set programming
• On the computational cost of disjunctive logic programming: Propositional case
• Possibilistic nested logic programs
• Possibilistic uncertainty handling for answer set programming
• Probabilistic reasoning with answer sets
• Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
• Semantics for possibilistic disjunctive programs
• Stable inference as intuitionistic validity
• Strong equivalence made easy: nested expressions and weight constraints
• Strongly equivalent logic programs
• Using possibilistic logic for modeling qualitative decision: answer set programming algorithms

Cited in

(5)

• The possibilistic Horn non-clausal knowledge bases
• Strongly equivalent logic programs
• Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
• Possibilistic nested logic programs
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

This page was built for publication: Possibilistic nested logic programs and strong equivalence

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