A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
EL Description Logic Modeling Querying Web and Learning Imperfect User Preferences
2006
International Semantic Web Conference
Preserved Fulltext
We offer a model based on connection between three EL-description logic systems: classical, annotated(fuzzy) and a new variant of Bayesian description logic. ...
In this position paper we share ideas on modeling querying web resources by (imperfect) combination of particular user preferences based on description logic. ...
For this, we can transform our previous work on imperfection in logic programming [8] to description logic framework . In [8] we have shown that generalized annotated programs (GAP) of M. ...
dblp:conf/semweb/Vojtas06
fatcat:xrkrimhcjzbgphwcaufvzz6c3m
Fuzzy classifier induction with GA-P algorithms
1999
European Society for Fuzzy Logic and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work we will use GA-P algorithms, a h ybrid method between genetic algorithms and genetic programming, to induce fuzzy rule based classi ers with a more general structure than the attainable when ...
Fuzzy rule based classi ers induction A fuzzy rule based classi er can always be written as a chain in certain context-free language, so applying genetic programming to perform classi er induction is straightforward ...
when inducting fuzzy classiers. ...
dblp:conf/eusflat/RamosC99
fatcat:ajio322avbaa7i4yigmkek5qbq
Logical Fuzzy Optimization
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We present a logical framework to represent and reason about fuzzy optimization problems based on fuzzy answer set optimization programming. ...
This is accomplished by allowing fuzzy optimization aggregates, e.g., minimum and maximum in the language of fuzzy answer set optimization programming to allow minimization or maximization of some desired ...
A fuzzy aggregates fuzzy answer set optimization program is a union of two sets of fuzzy logic rules, Π = R gen ∪ R pref . ...
arXiv:1304.2384v1
fatcat:36wwu35dvjenznjke3wm6zyxeu
Towards integrating fuzzy logic capabilities into an ontology-based Inductive Logic Programming framework
2011
2011 11th International Conference on Intelligent Systems Design and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Inductive Logic Programming (ILP) system with fuzzy logic capabilities. ...
This paper first analyses the state of the art in tools for fuzzy ontologies management and then describes how some of the most significant ones have been integrated in order to extend an ontologybased ...
Josué Iglesias also acknowledges this Ministry for his grant and the support received by every member of AKSW group. ...
doi:10.1109/isda.2011.6121843
dblp:conf/isda/IglesiasL11
fatcat:hd3np35qdbhwjlts5x67rhv5oq
Inductive Models of User Preferences for Semantic Web
2007
Databases, Texts, Specifications, Objects
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we will overview the current state-of-the-art in the area of acquisition of user preferences and their induction. ...
Main focus will be on the models of user preferences and on the induction of these models, but also the process of extracting preferences from the user behaviour will be studied. ...
Acknowledgment Supported by Czech projects MSM 0021620838, 1ET 100300517 and 1ET 100300419. ...
dblp:conf/dateso/Eckhardt07
fatcat:lebu6izn7bfffewq7vgffvgrve
Page 576 of Mathematical Reviews Vol. , Issue 97A
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “Rippling is a type of rewriting developed for inductive theorem proving that uses annotations to direct search. ...
Next we develop criteria for prov- ing the termination of such annotated rewriting, and introduce orders on annotated terms that lead to termination. ...
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The importance of this result is that for the rst 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. ...
Alferes and L. Caires for helpful discussions. We also thank the anonoymous referees for their valuable comments. ...
doi:10.1007/3-540-40006-0_5
fatcat:ypzpla3kjrg2dmrjjnxrea7ole
On the incorporation of interval-valued fuzzy sets into the Bousi-Prolog system: declarative semantics, implementation and applications
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show, by using potential applications, that fuzzy logic programming frameworks enhanced with them can correctly work together with lexical resources and ontologies in order to improve their capabilities ...
In this paper we analyse the benefits of incorporating interval-valued fuzzy sets into the Bousi-Prolog system. ...
We assume familiarity with the theory and practice of logic programming. ...
arXiv:1711.03147v1
fatcat:snbztbrcg5bgxmou77hppzwyqa
Page 1204 of Mathematical Reviews Vol. , Issue 93c
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A paraconsistent logic called an annotated logic, introduced by Subrahmanian in 1987, has been used since then as the basis for logic programming, for reasoning about databases and knowledge bases containing ...
The theory of induction consists of a precise version of Nicod’s principle and its statistical analogues. Philip L. ...
Fuzzy Logic, Annotation Domains and Semantic Web Languages
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This talk presents a detailed, self-contained and comprehensive account of the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such a RDF/RDFS, OWL 2 and RIF ...
We further show to which extend we may generalise them to so-called annotation domains, that cover also e.g. temporal, provenance and trust extensions. ...
The readers familiar with the annotated logic programming framework [39] , will notice the similarity of the approaches.
As we will see, ⊕ and ⊗ may be more involved. ...
doi:10.1007/978-3-642-23963-2_2
fatcat:vwgiptrpena7dkckythul4tke4
Page 4732 of Mathematical Reviews Vol. , Issue 92i
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In particular, a model of statistical induction based on rough sets is described; the soundness theorem for the proposed statistical induction model and some results concerning the speed of convergence ...
Fuzzy Sets and Systems 45 (1992), no. 1, 45-58.
Summary: “In the theory of fuzzy sets, it is usual to represent the “degree of belongingness’ by a number lying between 0 and 1. ...
From Fuzzy to Annotated Semantic Web Languages
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages ...
We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions. ...
The readers familiar with the annotated logic programming framework [35] , will notice the similarity of the approaches. ...
doi:10.1007/978-3-319-49493-7_6
fatcat:u4kbfmvkmbhiberrhh4bocml6u
Unfolding-based Improvements on Fuzzy Logic Programs
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We use a fuzzy variant of Prolog where each program clause can be interpreted under a different (fuzzy) logic. ...
In this paper we define two unfolding-based transformation rules that extend the classical definition of the unfolding rule (for pure logic programs) to a fuzzy logic setting. ...
Fuzzy Logic Programming is an interesting and still growing research area that agglutinates the efforts to introduce Fuzzy Logic into Logic Programming. ...
doi:10.1016/j.entcs.2005.01.040
fatcat:e2yebsdmgjfw5ox2izjqu6amum
Page 1090 of Mathematical Reviews Vol. , Issue 96b
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
); Shinji Kono, A combination of clausal and nonclausal temporal logic programs (40-57); Thom Friihwirth, Temporal logic and annotated constraint logic programming (58- 68); Stephan Merz, Efficiently executable ...
Valverde, Fuzzy logic, inductive and analogical reasoning (38-50); Didier Dubois and Henri Prade, Possibility theory, belief revision and nonmonotonic logic (51-61); Sew Bun Foong and Pei Zhuang Wang, ...
A Tabulation Proof Procedure for First-order Residuated Logic Programs: Soundness, Completeness and Optimizations
2006
2006 IEEE International Conference on Fuzzy Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertain or vague information, including fuzzy or annotated or probabilistic or similarity-based ...
In this paper, we introduce a sound and complete tabulation-based proof procedure for the firstorder extension of residuated logic programs. ...
In the specific topic of logic programming under uncertainty, we can find approaches involving either fuzzy or annotated or probabilistic or similarity-based logic programming [1] , [2] , [9] - [11 ...
doi:10.1109/fuzzy.2006.1681978
dblp:conf/fuzzIEEE/DamasioMO06
fatcat:7ufd6tdtgzgo3ej4quximvix6m
« Previous
Showing results 1 — 15 out of 2,223 results