Fuzzy answer set computation via satisfiability modulo theories
From MaRDI portal
Publication:4592999
DOI10.1017/S1471068415000241zbMATH Open1379.68036arXiv1507.03920OpenAlexW1682721953MaRDI QIDQ4592999FDOQ4592999
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different expressions; in particular the Godel and Luka fuzzy connectives are usually considered, due to their properties. Although the Godel conjunction can be easily eliminated from rule heads, we show through complexity arguments that such a simplification is infeasible in general for all other connectives. %, even if bodies are restricted to Luka or Godel conjunctions. The paper analyzes a translation of FASP programs into satisfiability modulo theories~(SMT), which in general produces quantified formulas because of the minimality of the semantics. Structural properties of many FASP programs allow to eliminate the quantification, or to sensibly reduce the number of quantified variables. Indeed, integrality constraints can replace recursive rules commonly used to force Boolean interpretations, and completion subformulas can guarantee minimality for acyclic programs with atomic heads. Moreover, head cycle free rules can be replaced by shifted subprograms, whose structure depends on the eliminated head connective, so that ordered completion may replace the minimality check if also Luka disjunction in rule bodies is acyclic. The paper also presents and evaluates a prototype system implementing these translations. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015.
Full work available at URL: https://arxiv.org/abs/1507.03920
Recommendations
- Fuzzy answer set programming: from theory to practice
- Fuzzy Answer Set Programming
- An introduction to fuzzy answer set programming
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- Fuzzy answer sets approximations
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Solving disjunctive fuzzy answer set programs
Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy logic; logic of vagueness (03B52) Logic programming (68N17)
Cites Work
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Title not available (Why is that?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Title not available (Why is that?)
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Title not available (Why is that?)
- MetiTarski: An automatic theorem prover for real-valued special functions
- Efficient solving of quantified inequality constraints over the real numbers
- Stable models and difference logic
- Ordered completion for first-order logic programs on finite structures
- Semantical characterizations and complexity of equivalences in answer set programming
- An introduction to fuzzy answer set programming
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- Logic Programming and Nonmonotonic Reasoning
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Answer set programming for continuous domains: a fuzzy logic approach
- Fuzzy answer sets approximations
- Stable Models of Fuzzy Propositional Formulas
- Title not available (Why is that?)
Cited In (6)
- On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs
- Fuzzy Answer Set Programming
- Modeling multi-valued biological interaction networks using fuzzy answer set programming
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- An introduction to fuzzy answer set programming
Uses Software
This page was built for publication: Fuzzy answer set computation via satisfiability modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592999)
