Possibilistic nested logic programs and strong equivalence

DOI10.1016/J.IJAR.2015.01.004zbMATH Open1311.68154OpenAlexW1964021485MaRDI QIDQ2344722FDOQ2344722

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

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

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)

Cites Work

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

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)