Results 1  10
of
27
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 8 (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 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 2 (2 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.
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
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 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.
Information technologies synergy of theory and application ⋆
"... In this lecture we give several examples and lessons learned from research, development and experiments in the area of theory and applications of information technology. We will try to describe a possible synergy of theory and application too. Namely, to describe where practical needs bring new prob ..."
Abstract
 Add to MetaCart
In this lecture we give several examples and lessons learned from research, development and experiments in the area of theory and applications of information technology. We will try to describe a possible synergy of theory and application too. Namely, to describe where practical needs bring new problems for theory and where theory helps to formulate methods, which should be verified in practice. In the theoretical part we will mention research on correctness and completeness of fuzzy logic programming [1,2] and various measures for evaluating success. In applications we mention acquaintance with development and experiments of preferential querying and user dependent topk answers [3]. In all of these it also depends on whether our task is deductive (querying),
On FirstOrder MultiAdjoint Logic Programming
"... In this paper we present a new quasicompleteness result for the firstorder theory of multiadjoint logic programs, a new general framework for generalized and fuzzy logic programming ..."
Abstract
 Add to MetaCart
In this paper we present a new quasicompleteness result for the firstorder theory of multiadjoint logic programs, a new general framework for generalized and fuzzy logic programming
On the representation theorem of multiadjoint concept lattices
 IFSAEUSFLAT
, 2009
"... Formal concept analysis has become an important and appealing research topic. There exist a number of different fuzzy extensions of formal concept analysis and of its representation theorem, which gives conditions for a complete lattice in order to be isomorphic to a concept lattice. In this paper w ..."
Abstract
 Add to MetaCart
Formal concept analysis has become an important and appealing research topic. There exist a number of different fuzzy extensions of formal concept analysis and of its representation theorem, which gives conditions for a complete lattice in order to be isomorphic to a concept lattice. In this paper we concentrate on the study of operational properties of the mappings α and β required in the representation theorem.
unknown title
"... A tabulation procedure for firstorder residuated logic programs ∗ Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertainty. Regarding automated deduction, a tabulation procedure was recently introduced for the propositional version ..."
Abstract
 Add to MetaCart
A tabulation procedure for firstorder residuated logic programs ∗ Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertainty. Regarding automated deduction, a tabulation procedure was recently introduced for the propositional version. In this paper, we introduce a sound and complete tabulationbased proof procedure for the firstorder extension of residuated logic programs. 1