Termination of logic programs with imperfect information: applications and query procedure

DOI10.1016/j.jal.2006.03.004zbMath1122.68025OpenAlexW2036430638WikidataQ58831010 ScholiaQ58831010MaRDI QIDQ2372195

Carlos V. Damásio, Jesús Medina, Manuel Ojeda Aciego

Publication date: 25 July 2007

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2006.03.004

zbMATH Keywords

fuzzy reasoningterminationlogic programmingprobabilistic reasoningtabulation proof procedures

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items (16)

On the existence and unicity of stable models in normal residuated logic programs ⋮ Right adjoint algebras versus operator left residuated posets ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ A coalgebraic approach to non-determinism: applications to multilattices ⋮ Tabulation proof procedures for fuzzy linguistic logic programming ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ A core language for fuzzy answer set programming ⋮ Reducing fuzzy answer set programming to model finding in fuzzy logics ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ Unnamed Item ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ DEFINITION AND ADAPTATION OF WEIGHTED FUZZY LOGIC PROGRAMS ⋮ Towards the Use of Hypergraphs in Multi-adjoint Logic Programming ⋮ Aggregated fuzzy answer set programming ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algebraic approach to non-classical logics
• Approximate reasoning by similarity-based SLD resolution.
• Hybrid probabilistic logic programs as residuated logic programs
• Tabling for non-monotonic programming
• Efficient top-down computation of queries under the well-founded semantics
• Probabilistic logic programming with conditional constraints
• Quantitative deduction and its fixpoint theory
• The Semantics of Predicate Logic as a Programming Language
• Hybrid probabilistic programs
• Logics in Artificial Intelligence
• Fuzzy logic programming

This page was built for publication: Termination of logic programs with imperfect information: applications and query procedure