Complexity of fuzzy answer set programming under Łukasiewicz semantics
DOI10.1016/J.IJAR.2013.10.011zbMATH Open1433.68082OpenAlexW2147395187MaRDI QIDQ465597FDOQ465597
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
Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical bilevel optimization. Algorithms and applications
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Depth-First Search and Linear Graph Algorithms
- Metamathematics of fuzzy logic
- Possibility theory, probability theory and multiple-valued logics: a clarification
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- The complexity of theorem-proving procedures
- Satisfiability in many-valued sentential logic is NP-complete
- A theorem about infinite-valued sentential logic
- An extended branch and bound algorithm for linear bilevel programming
- 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
- On the failure of the finite model property in some fuzzy description logics
- Spatial reasoning in a fuzzy region connection calculus
- Precise Fixpoint Computation Through Strategy Iteration
- An introduction to fuzzy answer set programming
- General Fuzzy Answer Set Programs
- A core language for fuzzy answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Non-monotonic fuzzy reasoning
- 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
- Epistemic foundation of stable model semantics
- Perspectives of System Informatics
Cited In (8)
- Solving Disjunctive Fuzzy Answer Set Programs
- Logic programming
- 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
- The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Fuzzy autoepistemic logic and its relation to fuzzy answer set programming
Recommendations
- Title not available (Why is that?) 👍 👎
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories 👍 👎
- An introduction to fuzzy answer set programming 👍 👎
- Fuzzy answer set programming: from theory to practice 👍 👎
- Complexity of fuzzy probability logics 👍 👎
- Fuzzy Answer Set Programming 👍 👎
- Some Complexity Results on Fuzzy Description Logics 👍 👎
- Fuzzy answer set computation via satisfiability modulo theories 👍 👎
This page was built for publication: Complexity of fuzzy answer set programming under Łukasiewicz semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465597)