Complexity of fuzzy answer set programming under Łukasiewicz semantics

DOI10.1016/J.IJAR.2013.10.011MaRDI QIDQ465597zbMATHOpenAlexFDO

Authors Marjon Blondeel, Steven Schockaert, 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

zbMATH Keywords

computational complexityanswer set programmingŁukasiewicz logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Recommendations

• Fuzzy answer set computation via satisfiability modulo theories
• Fuzzy answer set programming: from theory to practice
• scientific article; zbMATH DE number 6276275
• Some Complexity Results on Fuzzy Description Logics
• Fuzzy Answer Set Programming
• An introduction to fuzzy answer set programming
• Complexity of fuzzy probability logics
• Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories

Cites work

• scientific article; zbMATH DE number 1884402 (Why is no real title available?)
• scientific article; zbMATH DE number 1453068 (Why is no real title available?)
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A core language for fuzzy answer set programming
• A theorem about infinite-valued sentential logic
• An extended branch and bound algorithm for linear bilevel programming
• An introduction to fuzzy answer set programming
• Depth-First Search and Linear Graph Algorithms
• Epistemic foundation of stable model semantics
• Fuzzy description logic programs under the answer set semantics for the semantic web
• Fuzzy equilibrium logic: declarative problem solving in continuous domains
• General Fuzzy Answer Set Programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming and Nonmonotonic Reasoning
• Metamathematics of fuzzy logic
• New Results on the Complexity of p-Centre Problems
• Non-monotonic fuzzy reasoning
• On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs
• 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
• On the failure of the finite model property in some fuzzy description logics
• Perspectives of System Informatics
• Possibility theory, probability theory and multiple-valued logics: a clarification
• Practical bilevel optimization. Algorithms and applications
• Precise Fixpoint Computation Through Strategy Iteration
• Satisfiability in many-valued sentential logic is NP-complete
• Spatial reasoning in a fuzzy region connection calculus
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The complexity of theorem-proving procedures

Cited in

(9)

• Editorial: Weighted logics for artificial intelligence -- an introductory discussion
• Answers set programs for non-transferable utility games: expressiveness, complexity and applications
• Fuzzy equilibrium logic: declarative problem solving in continuous domains
• Fuzzy autoepistemic logic and its relation to fuzzy answer set programming
• Solving disjunctive fuzzy answer set programs
• Logic programming
• Fuzzy answer set computation via satisfiability modulo theories
• Modeling multi-valued biological interaction networks using fuzzy answer set programming
• The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm

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)