Fuzzy answer set computation via satisfiability modulo theories
From MaRDI portal
Publication:4592999
DOI10.1017/S1471068415000241zbMath1379.68036arXiv1507.03920OpenAlexW1682721953MaRDI QIDQ4592999
Rafael Peñaloza, Mario Alviano
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03920
Fuzzy logic; logic of vagueness (03B52) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered completion for first-order logic programs on finite structures
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- MetiTarski: An automatic theorem prover for real-valued special functions
- Stable models and difference logic
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Conflict-driven answer set solving: from theory to practice
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- An introduction to fuzzy answer set programming
- Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach
- Stable Models of Fuzzy Propositional Formulas
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Efficient solving of quantified inequality constraints over the real numbers
- Semantical characterizations and complexity of equivalences in answer set programming
- Fuzzy answer sets approximations
- Logic Programming and Nonmonotonic Reasoning
