40 Hits in 3.3 sec

Well-Definedness and Efficient Inference for Probabilistic Logic Programming under the Distribution Semantics [article]

Fabrizio Riguzzi, Terrance Swift
2011 arXiv   pre-print
We present the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) that computes the probability of queries by transforming a probabilistic program into a normal program and  ...  then applying SLG resolution with answer subsumption.  ...  Using these considerations it is straightforward to show that termination of bounded term-size programs holds for SLG evaluations extended with answer subsumption 14 .  ... 
arXiv:1110.0631v1 fatcat:7h4jamcalbfytb44jo5u4wkloy

Completion-based generalization inferences for the Description Logic ELOR with subjective probabilities

Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan
2014 International Journal of Approximate Reasoning  
In [24] an extension of EL with greatest fixpoints was introduced, where the generalization concepts always exist.  ...  Curé et al. [36] describe an application that evaluates user traces by making use of the probabilistic DLs as defined by Lutz and Schröder [1] .  ...  bases using this probabilistic DL available, we need to resort to an evaluation for ELOR; this provides an approximate indicative of the performance of the generalization algorithms for the probabilistic  ... 
doi:10.1016/j.ijar.2014.03.001 fatcat:tlhvh3mc4bhx3o3b2k22cuu2li

The Workshop on Logic-Based Artificial Intelligence

Jack Minker
1999 The AI Magazine  
In "Logic, Probability, and Decision Theory," it was argued that intelligent agents must be able to deal with uncertainty. H. Prade and D.  ...  This work is based on Fitting's theory of logic programs with negation as failure and generalizes this theory to other fixpoint formalisms. J. Delgrande and T.  ... 
doi:10.1609/aimag.v20i4.1484 dblp:journals/aim/Minker99 fatcat:jwvashh36rclfa3y25ao7pseum

Discovery of Probabilistic Mappings between Taxonomies: Principles and Experiments [chapter]

Rémi Tournaire, Jean-Marc Petit, Marie-Christine Rousset, Alexandre Termier
2011 Lecture Notes in Computer Science  
First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy.  ...  In this paper, we investigate a principled approach for defining and discovering probabilistic mappings between two taxonomies.  ...  However, those uncertainty coefficients do not have a probabilistic meaning and are just used for ranking.  ... 
doi:10.1007/978-3-642-22630-4_3 fatcat:fcxzulms3jh45foxl4crm5skba

Index—Volumes 1–89

1997 Artificial Intelligence  
67 I knowledge 1005 probabilistic logic 348, 985, 1124 Nilsson's -1124 probabilistic logical entailment 348 methods 1364 probabilistic model 1104, 1240 nonstandard -890 of language 1364 probabilistic  ...  Bayesian networks 1366 for Dempsters' rule 4 16 for estimation of surface orientation, WlSP 1026 for finding 3D shape 1001 for skeptical reasoning with binary defaults 637 for the description identification  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

A Tabulation Proof Procedure for First-order Residuated Logic Programs: Soundness, Completeness and Optimizations

C.V. Damasio, J. Medina, M. Ojeda-Aciego
2006 2006 IEEE International Conference on Fuzzy Systems  
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

Logic and Databases: Past, Present, and Future

Jack Minker
1997 The AI Magazine  
The impetus for it started approximately 20 years ago in 1976 when I visited Gallaire and Nicolas in Toulouse, France.  ...  Support for this article was received from the National Science Foundation under grant IRI 9300691.  ...  Although many of the views reflected in the article might be shared by those who made suggestions, I take full responsibility for them.  ... 
doi:10.1609/aimag.v18i3.1304 dblp:journals/aim/Minker97 fatcat:6foa4j2a45cabojbsyxj7rwpfq

Approximate Query Answering in Inconsistent Databases [article]

Federica Panella
2014 arXiv   pre-print
Classical algorithms for query optimization presuppose the absence of inconsistencies or uncertainties in the database and exploit only valid semantic knowledge provided, e.g., by integrity constraints  ...  of Belief Logic Programming to deal with the presence of possible correlation in the semantic knowledge used in the rewriting.  ...  Another classical model proposed to manage uncertain knowledge is based on probabilistic databases [14] , also extended to inconsistent probabilistic databases [32] ; among the models of uncertainty  ... 
arXiv:1405.0253v2 fatcat:utaglmy3bnajhppt3wujvgj2ou

Subject index volumes 1–200

1999 Theoretical Computer Science  
-3143 language, probabilistically -3143 generating algorithm for trees, 205 concepts, 2537 confluent rewrite systems, 2748 description languages, 1295 effective attribute evaluation programs,  ...  sorting with linear comparisons, 855 for sorting with linear queries, 403 relation, 403 time-Computer Science 2 13/214 (I 999) 5-436 for element distinctness, 924 CAD -9 2672 time-space-bounded  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

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

Combining answer set programming with description logics for the Semantic Web

Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
2008 Artificial Intelligence  
We define a suite of semantics for various classes of dl-programs, which conservatively extend the standard semantics of the respective classes and coincide with it in absence of a description logic knowledge  ...  We show that they have similar properties as ordinary logic programs, and also provide fixpoint characterizations in terms of (iterated) consequence operators.  ...  Hemaspaandra for providing valuable information on complexity-related issues during the preparation of this paper.  ... 
doi:10.1016/j.artint.2008.04.002 fatcat:6ljwvnzkkrec3martvmac4cdua

Schema Merging Based on Semantic Mappings [chapter]

Nikos Rizopoulos, Peter McBrien
2009 Lecture Notes in Computer Science  
In particular, I would like to thank Matteo Magnani, with whom I collaborated on parts presented in this dissertation.  ...  ) and which (2) explicitly represents and manages the uncertainty as to which semantic relationship is the correct one to use in any mapping.  ...  other approaches that use numerical values to represent the uncertainty regarding the data held in a data source, e.g. in probabilistic databases [58] .  ... 
doi:10.1007/978-3-642-02843-4_20 fatcat:hagpayybsbdtvfe4gvtz2tty7i

Page 1379 of Mathematical Reviews Vol. 27, Issue Index [page]

Mathematical Reviews  
(English summary) (see 95b:68009) Kostler, Gerhard (with KieBling, Werner; Théne, Helmut; Giintzer, Ulrich) The differential fixpoint operator with subsumption.  ...  (English summary) 95c:68060 — (with Sadri, Fereidoon) Probabilistic deductive databases.  ... 

Probabilistic Models for the Semantic Web [chapter]

Livia Predoiu
The Semantic Web for Knowledge and Data Management  
While different general approaches for extending Semantic Web languages with the ability to represent uncertainty are explored, we focus our attention on probabilistic approaches.  ...  be inadequate for representing uncertainty in many cases.  ...  Furthermore, a reasoner has been implemented that evaluates the fixpoint operator until the least fixpoint has been reached.  ... 
doi:10.4018/978-1-60566-028-8.ch005 fatcat:lmnye7vborg4tp5bf2qnyksjua

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
Third, inference method should take into account probabilistic evidence data because these are apparently domains abounding with uncertainty.  ...  We explore in this work efficient algorithms for evaluating tree-pattern queries with joins over probabilistic XML or, more specifically, for listing the answers to a query along with their computed or  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika
« Previous Showing results 1 — 15 out of 40 results