Filters








67 Hits in 4.6 sec

Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions

Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir
2014 International Journal of Approximate Reasoning  
Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more  ...  Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule.  ...  The semantics that agree with this intuition, i.e. that agree with the idea of uncertain rules rather than uncertain conclusions, are discussed in Section 3.  ... 
doi:10.1016/j.ijar.2013.09.006 fatcat:iyuqti3g4zbydickv736cdk43q

Ontology Temporal Evolution for Multi-Entity Bayesian Networks under Exogenous and Endogenous Semantic Updating [article]

Massimiliano Dal Mas
2010 arXiv   pre-print
a probabilistic framework for the Semantic Web.  ...  A solution that uses Multi-Entity Bayesan Networks with SWRL rules, and a Java program is presented to dynamically monitor Exogenous and Endogenous temporal evolution on updating merging ontologies on  ...  Bayesian probability theory (MEBN) with a set of SWRL rules, and a Java program implemented using suitable OWL libraries (like the Jena Semantic Web Framework for Java9 or OWL API10).  ... 
arXiv:1009.2084v1 fatcat:2566lg3qrvcqxbzdndx3vn6c44

From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group) [article]

Zied Bouraoui and Antoine Cornuéjols and Thierry Denœux and Sébastien Destercke and Didier Dubois and Romain Guillaume and João Marques-Silva and Jérôme Mengin and Henri Prade and Steven Schockaert and Mathieu Serrurier and Christel Vrain
2019 arXiv   pre-print
, the semantic description of vector representations, the combination of deep learning with high level inference, knowledge graph completion, declarative frameworks for data mining, or preferences and  ...  Then some methodologies combining reasoning and learning are reviewed (such as inductive logic programming, neuro-symbolic reasoning, formal concept analysis, rule-based representations and ML, uncertainty  ...  The paper [dGZ99] exploits this idea to represent propositional logic programs with recurrent neural networks (RNNs) which can be used to compute the semantics of the program.  ... 
arXiv:1912.06612v1 fatcat:yfnx3pzs6jhxtggaylc76pwjc4

From Fuzzy to Annotated Semantic Web Languages [chapter]

Umberto Straccia, Fernando Bobillo
2017 Lecture Notes in Computer Science  
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  ...  Capturing Intelligence: Fuzzy Logic and the Semantic Web. Elsevier, Amsterdam (2006) 48. Lukasiewicz, T.: Fuzzy description logic programs under the answer set semantics for the semantic web.  ...  .: Fuzzy description logic programs under the answer set semantics forthe semantic web. Fundamenta Informaticae 82(3), 289-310 (2008) Table 1 . 1 Properties for t-norms and s-norms.  ... 
doi:10.1007/978-3-319-49493-7_6 fatcat:u4kbfmvkmbhiberrhh4bocml6u

The legacy of 50 years of fuzzy sets: A discussion

Didier Dubois, Henri Prade
2015 Fuzzy sets and systems (Print)  
Zadeh for representing sets with unsharp boundaries and uncertainty induced by granules of information expressed with words.  ...  It also questions the motivations for some existing generalized fuzzy sets. This note clearly reflects the shared personal views of its authors.  ...  We now survey the use of fuzzy sets with respect to these three semantics.  ... 
doi:10.1016/j.fss.2015.09.004 fatcat:yqsjyfemjfhyzoqthwumsbiok4

Reasoning with conditionals

Guy Politzer
2007 Topoi  
In the second part, the main theories of deductive reasoning (mental rules, mental models, and the probabilistic approach) are considered in turn; their content is summarised and the semantics they assume  ...  The last part presents the recent shift of interest towards the study of conditional reasoning in context, that is, with large knowledge bases and uncertain premises.  ...  This is taken in charge by the reasoning program which stipulates, for arguments whose conclusion is a conditional, to add the antecedent to the premise set and treat the consequent as the conclusion.  ... 
doi:10.1007/s11245-006-9001-9 fatcat:7zcvo5sms5hcjpduqtxns36mkq

The paradoxical success of fuzzy logic

C. Elkan, H.R. Berenji, B. Chandrasekaran, C.J.S. de Silva, Y. Attikiouzel, D. Dubois, H. Prade, P. Smets, C. Freksa, O.N. Garcia, G.J. Klir, Bo Yuan (+11 others)
1994 IEEE Expert  
For a sentence composed from simple assertions and the logical connectives "and" (A), "or" (v), and "not" ( 1 ) degree of truth is defined as follows: ~ An earlier version with the same title appeared  ...  Then for all p E P, Q) E { 0, 1 ] W  ...  Acknowledgments The author is grateful to many colleagues for useful comments on earlier versions of this article.  ... 
doi:10.1109/64.336150 fatcat:33nqixzz6femrnbhcffxcuvuxm

Ontologies and Data Management: A Brief Survey

Thomas Schneider, Mantas Šimkus
2020 Künstliche Intelligenz  
Information systems have to deal with an increasing amount of data that is heterogeneous, unstructured, or incomplete.  ...  This survey gives an overview of research work on the use of ontologies for accessing incomplete and/or heterogeneous data.  ...  We would like to thank Anni-Yasmin Turhan, Magdalena Ortiz, and the anonymous reviewers for their useful remarks, which helped us to improve this survey.  ... 
doi:10.1007/s13218-020-00686-3 pmid:32999532 pmcid:PMC7497697 fatcat:zeskjfjrpvcojjh6q3yjzhlyci

The Emergence of Fuzzy Sets: A Historical Perspective [chapter]

Didier Dubois, Henri Prade
2016 Studies in Fuzziness and Soft Computing  
The report gathers 8 papers, and thus covers many issues in relation with fuzzy sets.  ...  The 6th paper (with Davide Ciucci) surveys the different forms of hybridation between fuzzy set and rough set theories using squares and cubes of opposition.  ...  [31] M Inuiguchi, J Ramik Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem Fuzzy sets  ... 
doi:10.1007/978-3-319-31093-0_1 fatcat:zc63ekhuend2ddmj5tvor5m7yq

Index—Volumes 1–89

1997 Artificial Intelligence  
, ideally -1205 conclusion set 1205 conclusions 898 inheritance, true -898 model 962 prediction 971 reason maintenance 962 reasoning 637,966 semantics 962 theory of inheritance 550 skewed distributions  ...  sets 1143 rules 1143 semantics 575,622, 1069 temporal reasoning 1104 theories 1112 world model 1175 probabilistically coupled propositions 368 probabilities 400, 1112 associated with hypotheses  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

A fuzzy ontology for semantic modelling and recognition of human behaviour

Natalia Díaz Rodríguez, Manuel P. Cuéllar, Johan Lilius, Miguel Delgado Calvo-Flores
2014 Knowledge-Based Systems  
We propose a fuzzy ontology for human activity representation, which allows us to model and reason about vague, incomplete, and uncertain knowledge.  ...  Some relevant subdomains found to be missing in previous proposed ontologies for this domain were modelled as well.  ...  We also thank Fernando Bobillo and Robin Wikström for their advice with FuzzyOWL and fuzzyDL tools.  ... 
doi:10.1016/j.knosys.2014.04.016 fatcat:fjkpauxkqffp5hcm7nxji56shu

Knowledge Discovery in Databases

Roland Düsing
2000 Wirtschaftsinformatik  
We thus discover or learn rules with head comp(X) and with bodies consisting of literals built from the premise predicates. The learned rules will predict the competitiveness from the premises.  ...  For each rm we got the information shown in gure 1.2. An expert has given two kinds of appraisals : premises and conclusions.  ...  Two rules r and r 0 are semantically equal i for any set of facts F any set of rules R and any query, (i) R frg is strati ed i R fr 0 g is, and (ii) the answer to this query is the same on the database  ... 
doi:10.1007/bf03250720 fatcat:qapnx6g3zjexne276yw2xiohse

Viewpoints on Emergent Semantics [chapter]

Philippe Cudré-Mauroux, Karl Aberer, Alia I. Abdelmoty, Tiziana Catarci, Ernesto Damiani, Arantxa Illaramendi, Mustafa Jarrar, Robert Meersman, Erich J. Neuhold, Christine Parent, Kai-Uwe Sattler, Monica Scannapieco (+3 others)
2006 Lecture Notes in Computer Science  
We introduce a novel view on how to deal with the problems of semantic interoperability in distributed systems.  ...  This is a complex systems perspective on the problem of dealing with semantics. We highlight some of the distinctive features of our vision and point out preliminary examples of its application.  ...  Acknowledgment We would like to thank Avigdor Gal for his insightful comments and suggestions about this work.  ... 
doi:10.1007/11803034_1 fatcat:u5l6gr5frfdufcjzfdnvgowq44

Knowledge Discovery in Databases [chapter]

2012 Data Mining for Bioinformatics  
We t h us discover or learn rules with head comp(X) and with bodies consisting of literals built from the premise predicates. The learned rules will predict the competitiveness from the premises.  ...  For each rm we got the information shown in gure 1.2. An expert has given two kinds of appraisals : premises and conclusions.  ...  T w o rules r and r 0 are semantically equal i for any set of facts F any set of rules R and any query, (i) R f rg is strati ed i R f r 0 g is, and (ii) the answer to this query is the same on the database  ... 
doi:10.1201/b13091-5 fatcat:i2uwuozwtvatrbamfzm3kiouzi

Knowledge Discovery in Databases [chapter]

1999 Lecture Notes in Computer Science  
We t h us discover or learn rules with head comp(X) and with bodies consisting of literals built from the premise predicates. The learned rules will predict the competitiveness from the premises.  ...  For each rm we got the information shown in gure 1.2. An expert has given two kinds of appraisals : premises and conclusions.  ...  T w o rules r and r 0 are semantically equal i for any set of facts F any set of rules R and any query, (i) R f rg is strati ed i R f r 0 g is, and (ii) the answer to this query is the same on the database  ... 
doi:10.1007/3-540-48316-0_2 fatcat:re6bvvognjcopdbe4yqgdyh5ny
« Previous Showing results 1 — 15 out of 67 results