Results 1  10
of
38
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 18 (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 10 (0 self)
 Add to MetaCart
(Show Context)
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.
On multiadjoint concept lattices: definition and representation theorem
 Lect. Notes in Computer Science
, 2007
"... Abstract. Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multiadjoint concept lattices which embeds different fuzzy extensions of concept lattices, our main result being the repr ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multiadjoint concept lattices which embeds different fuzzy extensions of concept lattices, our main result being the representation theorem of this paradigm. As a consequence of this theorem, the representation theorems of the other paradigms can be proved more directly. Moreover, the multiadjoint paradigm enriches the language providing greater flexibility to the user.
M.: Towards a fuzzy answer set semantics for residuated logic programs
 In: Web Intelligence/IAT Workshops, IEEE
, 2008
"... In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation. 1. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation. 1.
Operational/Interpretive Unfolding of Multiadjoint Logic Programs
"... Abstract: Multiadjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systemat ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract: Multiadjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systematically applied in a similar way to classical resolution steps in pure logic programming, thus returning a computed substitution together with an expression where all atoms have been exploited. This last expression is then interpreted under a given lattice during the so called interpretive phase, hence returning a value which represents the fuzzy component (truth degree) of the computed answer. On the other hand, unfolding is a well known transformation rule widely used in declarative programming for optimizing and specializing programs, among other applications. In essence, it is usually based on the application of operational steps on the body of program rules. The novelty of this paper consists in showing that this process can also be made in terms of interpretive steps. We present two strongly related kinds of unfolding (operational and interpretive), which, apart from exhibiting strong correctness properties (i.e. they preserve the semantics of computed substitutions and truth degrees) they are able to significantly simplify the two execution phases when solving goals.
Using FLOPER for Running/Debugging Fuzzy Logic
 Programs”, Proceedings of IPMU'08
, 2008
"... Fuzzy Logic Programming is an interesting and still growing research area that agglutinates the efforts for introducing fuzzy logic into logic programming, in order to incorporate more expressive resources on such languages for dealing with uncertainty and approximated reasoning. The multiadjoi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Fuzzy Logic Programming is an interesting and still growing research area that agglutinates the efforts for introducing fuzzy logic into logic programming, in order to incorporate more expressive resources on such languages for dealing with uncertainty and approximated reasoning. The multiadjoint logic programming approach represents a recent and extremely flexible fuzzy logic paradigm for which, unfortunately, we have not found practical tools implemented so far. In this work we describe a prototype system, the FLOPER tool, which is able to directly translate fuzzy logic programs into Prolog code in order to safely execute these final programs inside any standard Prolog interpreter in a completely transparent way for the final user. The system also generates a lowlevel representation of the fuzzy code offering debugging (tracing) capabilities and opening the door to the design of more sophisticated program manipulation tasks such as program optimization, program specialization and so on. ∗This work has been partially supported by the
A WAM implementation for flexible query answering
 In Proc. of IASTEDASC
, 2006
"... In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similaritybased SLD resolution can be used as the basis for a new logic language that allows to manage uncertain and imprecise ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similaritybased SLD resolution can be used as the basis for a new logic language that allows to manage uncertain and imprecise information in a declarative framework, hence its importance. Similaritybased SLD resolution can be seen as an extension of the classical SLD resolution procedure where the syntactic unification algorithm has been replaced by a fuzzy unification algorithm. In this paper we address the problem of adapting the implementation of a WAM to incorporate fuzzy unification. As a result, we obtain a Prolog implementation based on similarity relations that we call SProlog. To the best of our knowledge this is the first WAM implementation that supports similaritybased SLD resolution.
A SimilarityBased Unification Model for Flexible Querying
, 2002
"... We use the formal model for similaritybased fuzzy unification in multiadjoint logic programs to provide new tools for flexible querying. 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 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We use the formal model for similaritybased fuzzy unification in multiadjoint logic programs to provide new tools for flexible querying. 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.
Relationship between two FCA approaches on heterogeneous formal contexts
 Proceedings of CLA
, 2012
"... Abstract. We show a relationship between two theoretical approaches of Formal Concept Analysis working with socalled heterogeneous formal context i.e. such context in which each object and attribute can have own datatype. One of them is presented in [19]; each value in a formal context is some Gal ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We show a relationship between two theoretical approaches of Formal Concept Analysis working with socalled heterogeneous formal context i.e. such context in which each object and attribute can have own datatype. One of them is presented in [19]; each value in a formal context is some Galois connection between the lattices corresponding to the appropriate object and attribute. Another approach is presented in our paper [1] and it is a unifying platform of approaches from [14] and [11], [12]. In this paper, we prove that each of them can be derived from another.
A connection between Similarity Logic Programming and Gödel Modal Logic
"... In this paper we relate two logical similaritybased approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The seco ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we relate two logical similaritybased approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The second approach is a manyvalued modal logic approach where ✸p is understood as approximately p. Here, the similarity relations are introduced at the level of the Kripke models where possible worlds can be similar to some extent. We show that the former approach can be expressed inside the latter.