Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
type: Item
instance of: scholarly article
title: Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
zbMATH Open document ID: 1186.68098
author: Yann Loyer
author: Umberto Straccia
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2009-11-23T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03B52
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 5636905
Wikidata QID: Q58049256
describes a project that uses: Ciao
describes a project that uses: FRIL
describes a project that uses: FPROLOG
MaRDI profile type: Publication
full work available at URL: s10472-008-9099-0
OpenAlex ID: W2100344918
cites work: Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants
cites work: Evidential support logic programming
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: Annotated fuzzy logic programs
cites work: Integrated Query Answering with Weighted Fuzzy Rules
cites work: Hybrid probabilistic logic programs as residuated logic programs
cites work: Logics in Artificial Intelligence
cites work: Q4236380
cites work: Q4798022
cites work: Termination of logic programs with imperfect information: applications and query procedure
cites work: Logic Programming
cites work: Hybrid probabilistic programs
cites work: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
cites work: Q4736514
cites work: Uniform semantic treatment of default and autoepistemic logics
cites work: Incremental recomputation in local languages.
cites work: Nonrecursive incremental evaluation of Datalog queries
cites work: Possibility theory, probability theory and multiple-valued logics: a clarification
cites work: Fuzzy logic programming
cites work: The family of stable models
cites work: Fixpoint semantics for logic programming a survey
cites work: A kripke-kleene semantics for logic programs*
cites work: Pseudo-Boolean valued Prolog
cites work: Bilattices and the semantics of logic programming
cites work: Q4428304
cites work: Q4783476
cites work: Combining probabilistic logic programming with the power of maximum entropy
cites work: Q4235437
cites work: Fixed point theorems in logic programming
cites work: Q3798294
cites work: A comparison of fuzzy and annotated logic programming
cites work: An annotated logic theorem prover for an extended possibilistic logic
cites work: Q4470495
cites work: Uncertain deductive databases: a hybrid approach
cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
cites work: Q4473152
cites work: Q4708597
cites work: Parametrized semantics of logic programs -- a unifying framework
cites work: Hypothesis-based semantics of logic programs in multivalued logics
cites work: Q4708924
cites work: Q4409157
cites work: Mathematical Foundations of Computer Science 2003
cites work: Mathematical Foundations of Computer Science 2004
cites work: Any-world assumptions in logic programming
cites work: Epistemic foundation of stable model semantics
cites work: Logic programming with signs and annotations
cites work: Q4360108
cites work: Q4955341
cites work: Q4242057
cites work: Q4798019
cites work: Probabilistic logic programming with conditional constraints
cites work: Fuzzy modus ponens: A new model suitable for applications in knowledge-based systems
cites work: The implementation of FPROLOG - a fuzzy PROLOG interpreter
cites work: Q4955342
cites work: Quantitative disjunctive logic programming: Semantics and computation
cites work: A neural implementation of multi-adjoint logic programming

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Q4798020

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Q4736480

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Similarity-based unification: A multi-adjoint approach

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Q3939270

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Q4413492

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Fundamentals of Fuzzy Prolog

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Probabilistic logic programming

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Stable semantics for probabilistic deductive databases

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Answering queries from context-sensitive probabilistic knowledge bases

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Q4893150

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Probabilistic Horn abduction and Bayesian networks

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: The independent choice logic for modelling multiple agents under uncertainty

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Clausal logic and logic programming in algebraic domains

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Arguments and misunderstandings: fuzzy unification for negotiating agents

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: SOFSEM 2004: Theory and Practice of Computer Science

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Approximate reasoning by similarity-based SLD resolution.

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Q3820052

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: A lattice-theoretical fixpoint theorem and its applications

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Quantitative deduction and its fixpoint theory

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: The well-founded semantics for general logic programs

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Logic Programming

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (cites work)
cites work: Fuzzy logic programming

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (DBLP publication ID)
DBLP publication ID: journals/amai/LoyerS09

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (DOI)
DOI: 10.1007/S10472-008-9099-0

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Generalized well-founded semantics for logic programs
Similarity Score: 0.9125813
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: The well-founded semantics for general logic programs
Similarity Score: 0.90684277
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Q4902254
Similarity Score: 0.8967894
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Mathematical Foundations of Computer Science 2003
Similarity Score: 0.89120984
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
Similarity Score: 0.8893365
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Q4409157
Similarity Score: 0.88505065
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies
Similarity Score: 0.8834991
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Well-Supported Semantics for Logic Programs with Generalized Rules
Similarity Score: 0.88208663
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: On the equivalence of semantics for normal logic programs
Similarity Score: 0.8808683
Recommender Run: Recommender Run 3

Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Recommended article)
Recommended article: Generalized disjunctive well-founded semantics for logic programs.
Similarity Score: 0.8780037
Recommender Run: Recommender Run 3