Complexity of fuzzy answer set programming under Łukasiewicz semantics
From MaRDI portal
Publication:465597
DOI10.1016/j.ijar.2013.10.011zbMath1433.68082MaRDI QIDQ465597
Steven Schockaert, Marjon Blondeel, Dirk Vermeir, Martine De Cock
Publication date: 23 October 2014
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2013.10.011
68Q25: Analysis of algorithms and problem complexity
68T37: Reasoning under uncertainty in the context of artificial intelligence
68N17: Logic programming
Related Items
Fuzzy answer set computation via satisfiability modulo theories, Editorial: Weighted logics for artificial intelligence -- an introductory discussion, Modeling multi-valued biological interaction networks using fuzzy answer set programming, Answers set programs for non-transferable utility games: expressiveness, complexity and applications, Fuzzy autoepistemic logic and its relation to fuzzy answer set programming, Solving Disjunctive Fuzzy Answer Set Programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A core language for fuzzy answer set programming
- On the failure of the finite model property in some fuzzy description logics
- Spatial reasoning in a fuzzy region connection calculus
- An extended branch and bound algorithm for linear bilevel programming
- Satisfiability in many-valued sentential logic is NP-complete
- Non-monotonic fuzzy reasoning
- Practical bilevel optimization. Algorithms and applications
- Metamathematics of fuzzy logic
- Possibility theory, probability theory and multiple-valued logics: a clarification
- An introduction to fuzzy answer set programming
- On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
- On the existence and unicity of stable models in normal residuated logic programs
- Fuzzy Equilibrium Logic
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- General Fuzzy Answer Set Programs
- On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs
- New Results on the Complexity of p-Centre Problems
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Epistemic foundation of stable model semantics
- Depth-First Search and Linear Graph Algorithms
- The complexity of theorem-proving procedures
- Precise Fixpoint Computation Through Strategy Iteration
- A theorem about infinite-valued sentential logic
- Perspectives of System Informatics
