Fuzzy answer set computation via satisfiability modulo theories
From MaRDI portal
Publication:4592999
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.
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
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A finite-valued solver for disjunctive fuzzy answer set programs
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- An introduction to fuzzy answer set programming
- Answer set programming for continuous domains: a fuzzy logic approach
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- Conflict-driven answer set solving: from theory to practice
- Efficient solving of quantified inequality constraints over the real numbers
- Fuzzy answer sets approximations
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- MetiTarski: An automatic theorem prover for real-valued special functions
- On the computational cost of disjunctive logic programming: Propositional case
- Ordered completion for first-order logic programs on finite structures
- Propositional semantics for disjunctive logic programs
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Semantical characterizations and complexity of equivalences in answer set programming
- Stable models and difference logic
- Stable models of fuzzy propositional formulas
Cited in
(8)- On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs
- Fuzzy Answer Set Programming
- Fuzzy answer sets approximations
- Modeling multi-valued biological interaction networks using fuzzy answer set programming
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- An introduction to fuzzy answer set programming
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
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)
