Results 1  10
of
26
Monotonic and Residuated Logic Programs
, 2001
"... In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebrai ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebraic properties within the very general setting. Then, the existence of a minimum model and of a monotonic immediate consequences operator is guaranteed, and they are related as in classical logic programming. Afterwards we study the more restricted class of residuated logic programs which is able to capture several quite distinct logic programming semantics. Namely: Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic Logic Programming. We provide the embedding of possibilistic logic programming.
A Procedural Semantics for MultiAdjoint Logic Programming
 In Progress in Artificial Intelligence, EPIA’01
, 2001
"... Multiadjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. ..."
Abstract

Cited by 22 (13 self)
 Add to MetaCart
Multiadjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed.
Similaritybased unification: a multiadjoint approach. Fuzzy sets and systems
 In Proc. EUSFLAT Conference in Fuzzy Logic and Technology
, 2002
"... The aim of this paper is to build a formal model for fuzzy unification in multiadjoint logic programs containing both a declarative and a procedural part, and prove its soundness and completeness. Our approach is based on a general framework for logic programming, which gives a formal model of fuzz ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
The aim of this paper is to build a formal model for fuzzy unification in multiadjoint logic programs containing both a declarative and a procedural part, and prove its soundness and completeness. Our approach is based on a general framework for logic programming, which gives a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of firstorder logic with equality.
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
, 2002
"... In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kow ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic Logic Programming. Moreover, the embedding provides a more general semantical structure paving the way for defining paraconsistent probabilistic reasoning with a logic programming semantics.
Sorted MultiAdjoint Logic Programs: Termination Results and Applications
"... A general framework of logic programming allowing for the combination of several adjoint lattices of truthvalues is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
A general framework of logic programming allowing for the combination of several adjoint lattices of truthvalues is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several extensions of these conditions are presented and related to some wellknown formalisms for probabilistic logic programming.
Managing uncertainty and vagueness in description logics, logic programs and description logic programs
, 2008
"... Managing uncertainty and/or vagueness is starting to play an important role in Semantic Web representation languages. Our aim is to overview basic concepts on representing uncertain and vague knowledge in current Semantic Web ontology and rule languages (and their combination). ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
Managing uncertainty and/or vagueness is starting to play an important role in Semantic Web representation languages. Our aim is to overview basic concepts on representing uncertain and vague knowledge in current Semantic Web ontology and rule languages (and their combination).
Annotated answer set programming
 In: Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in KnowledgeBased Systems (IPMU06
, 2006
"... We present Annotated Answer Set Programming, that extends the expressive power of disjunctive logic programming with annotation terms, taken from the generalized annotated logic programming framework. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We present Annotated Answer Set Programming, that extends the expressive power of disjunctive logic programming with annotation terms, taken from the generalized annotated logic programming framework.
A Completeness Theorem for MultiAdjoint Logic Programming
 In Proc. FUZZIEEE’01. The 10th IEEE International Conference on Fuzzy Systems, IEEE
, 2001
"... Mukiadjoint logic programs generalise monotonic and residuated logic pro grams [21 in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is g ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Mukiadjoint logic programs generalise monotonic and residuated logic pro grams [21 in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is given for the paradigm of multiadjoint logic programming and a completeness result is proved.
On Termination of a Tabulation Procedure for Residuated Logic Programming
 6th Intl Workshop on Termination
, 2003
"... Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. A first result states that for any definite residuated logic program the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely m ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. A first result states that for any definite residuated logic program the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely many steps. Then, a tabulation query procedure is introduced, and it is shown that the procedure terminates every definite residuated logic program.
A MultiAdjoint Logic Approach to Abductive Reasoning
 In Logic Programming, ICLP’01
, 2001
"... Multiadjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Multiadjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed.