Filters








3,002 Hits in 2.6 sec

Position paper

Peter F. Patel-Schneider, Ian Horrocks
2006 Proceedings of the 15th international conference on World Wide Web - WWW '06  
After considering some of these differences, we argue that, although some of the characteristics of Datalog have their utility, the open environment of the Semantic Web is better served by standard logics  ...  Classical logics and Datalog-related logics have both been proposed as underlying formalisms for the Semantic Web.  ...  In the Datalog paradigm, on the other hand, different names always identify different objects. Open World The Semantic Web is a very open environment.  ... 
doi:10.1145/1135777.1135784 dblp:conf/www/Patel-SchneiderH06 fatcat:u7v73ravibgepnpuxupjruujai

Integrating Ontologies and Rules: Semantic and Computational Issues [chapter]

Riccardo Rosati
2006 Lecture Notes in Computer Science  
In particular, we focus on the following aspects: (i) from the semantic viewpoint, ontologies are based on open-world semantics, while rules are typically interpreted under closed-world semantics.  ...  In particular, we take into account ontologies expressed in Description Logics and rules expressed in Datalog (and its nonmonotonic extensions).  ...  In particular, the author wishes to warmly thank Enrico Franconi, Ian Horrocks, Boris Motik, Marie-Christine Rousset, and Sergio Tessaris.  ... 
doi:10.1007/11837787_5 fatcat:yq2djlkxnvctfkhhmfsnaiazxe

Complexity of the Stable Model Semantics for Queries on Incomplete Databases [chapter]

Jos de Bruijn, Stijn Heymans
2009 Lecture Notes in Computer Science  
Under open-world interpretation, adding negation to non-recursive Datalog already leads to undecidability, but the complexity of certain answers for negation-free queries is the same as under closed-world  ...  We consider both possible and certain answers and both closed-and open-world interpretation of C-databases with and without conditions.  ...  The work in this paper was partially supported by the European Commission under the project ONTORULE (IST-2009-231875).  ... 
doi:10.1007/978-3-642-04238-6_11 fatcat:qttfzgibe5bnhidb37h54delxa

Ontology-Enriched Data Management with Partially Complete Data

Sanja Pavlovic
2019 International Web Rule Symposium  
As fragments of first-order logic, description logics (DLs) make the assumption that what is not known to be true is unknown (open-world assumption).  ...  In DLs this can be done by specifying which predicates should be interpreted under the closed-world view.  ...  This clearly illustrates the need for formalisms that offer a more flexible support for open-world and closed-world reasoning.  ... 
dblp:conf/ruleml/Pavlovic19 fatcat:6k7lcbkchbelraqelcu33frpry

Queries with guarded negation

Vince Bárány, Balder ten Cate, Martin Otto
2012 Proceedings of the VLDB Endowment  
computationally well behaved, in terms of testing query containment, query evaluation, open-world query answering, and boundedness.  ...  A well-established and fundamental insight in database theory is that negation (also known as complementation) tends to make queries difficult to process and difficult to reason about.  ...  Open world semantics is the natural choice when working with incomplete databases, in data exchange settings, and in the context of ontological reasoning.  ... 
doi:10.14778/2350229.2350250 fatcat:aripunuyezfhrpdaslsci3lspu

Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules

GIORGIO ORSI, LETIZIA TANCA
2010 Theory and Practice of Logic Programming  
Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since.  ...  The product of this joint effort has been a set of logic-based formalisms, such as the Relational Calculus (Codd 1970), Datalog (Ceriet al. 1990), Description Logics (Baaderet al. 2007), etc., capturing  ...  Dahl for her insights on Datalog applications for Natural Language Processing and to B. Motik for his presentation on Datalog-based formalisms in the Semantic-Web community.  ... 
doi:10.1017/s1471068410000086 fatcat:2zi7w5eejvanpknuncdy6qmw2e

Logic Programming in DataLog: A Long Tour from Theory to Practice

Sergio Greco, Luigi Palopoli, Nicola Leone, Pasquale Rullo, Domenico Saccà
2008 Festschrifts: Birthday, In Memory of ...  
, open to all ASP systems).  ...  YOUTH: non monotonic reasoning in DATALOG The realization of common-sense reasoning systems has been, since the beginning, one of the natural application realm of logic programming.  ... 
dblp:conf/birthday/GrecoPLRS08 fatcat:ps5o6yg4ffcapnx3i5xfjjrpve

Expressivity of Planning with Horn Description Logic Ontologies

Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Markus Krötzsch, Bernhard Nebel, Marcel Steinmetz
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Here we address open-world state constraints formalized by planning over a description logic (DL) ontology.  ...  State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions.  ...  This is due to Datalog ¬ -rewritability, which allows us to reduce open-world to closed-world reasoning.  ... 
doi:10.1609/aaai.v36i5.20489 fatcat:o7z5xhol6ffxtnk4y3x3lqddp4

Rewritability Results for OMQs with Closed Predicates

Magdalena Ortiz
2020 International Workshop on Description Logics  
The semantics of Description Logic (DL) ontologies adopts the open-world assumption (OWA) from classical first-order logic (FOL), which makes them well suited to reason about incomplete knowledge.  ...  restricting in a novel yet non-trivial way the use of closed predicates.  ...  the open-world inference and the possibility of reasoning about incomplete aspects of the world [18] .  ... 
dblp:conf/dlog/Ortiz20 fatcat:uf5e25bsabgkfcjykoqs74hobm

Semantic and Computational Advantages of the Safe Integration of Ontologies and Rules [chapter]

Riccardo Rosati
2005 Lecture Notes in Computer Science  
In particular, integrating DLs with nonmonotonic rules requires to properly deal with two semantic discrepancies: (a) DLs are based on the Open World Assumption, while rules are based on (various forms  ...  , we close a problem left open in [18], i.e., decidability of OWL-DL with DL-safe rules.  ...  CWA: DLs are fragments of first-order logic (FOL), hence their semantics is based on the Open World Assumption (OWA) of classical logic, while rules are based on a Closed World Assumption (CWA), imposed  ... 
doi:10.1007/11552222_6 fatcat:ci3fsawavrcqfldwc52a7ytvim

Warded Datalog+/- Reasoning in Financial Settings with Harmful Joins

Teodoro Baldazzi, Paolo Atzeni
2022 International Conference on Extending Database Technology  
The algorithm is integrated into the Vadalog system, a state-of-the-art Warded Datalog+/--based reasoner.  ...  However, to enable these strategies, the Warded Datalog+/-settings must be in a "harmless" form, i.e., without joins on variables affected by existential quantification.  ...  As a powerful Warded Datalog ±based reasoner, the Vadalog system is employed to efficiently solve relevant tasks in real-world scenarios, mainly related to the financial and business realm [11] .  ... 
dblp:conf/edbt/BaldazziA22 fatcat:3wabumezybbvlcrqomm36uobk4

Ontology-Mediated Query Answering over Log-Linear Probabilistic Data

Stefan Borgwardt, İsmail İlkan Ceylan, Thomas Lukasiewicz
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Our approach differs from MLNs in our use of ontological reasoning, in particular using the open-domain assumption for entailment.  ...  As in MLNs, we restrict the probability distribution to the known objects, but additionally use first-order semantics over arbitrary, possibly infinite domains, whereby we achieve open-world, open-domain  ... 
doi:10.1609/aaai.v33i01.33012711 fatcat:epzrqmxrhbarhnx2pp6wlk65m4

Ontology-Mediated Queries for Probabilistic Databases

Stefan Borgwardt, Ismail Ceylan, Thomas Lukasiewicz
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Recently, open-world probabilistic databases (OpenPDBs) were proposed to address this issue by allowing probabilities of unknown facts to take any value from a fixed probability interval.  ...  In this paper, we extend OpenPDBs by Datalog+/- ontologies, under which both upper and lower probabilities of queries become even more informative, enabling us to distinguish queries that were indistinguishable  ...  Open-World Probabilistic Databases. An open-world probabilistic database (OpenPDB) over γ is a pair G = (P, λ), where λ ∈ [0, 1] and P is a PDB.  ... 
doi:10.1609/aaai.v31i1.10680 fatcat:o6f5sgqqvfd7tabooreh5doid4

Possible Worlds Explorer: Datalog & Answer Set Programming for the Rest of Us

Sahil Gupta, Yi-Yun Cheng, Bertram Ludäscher
2019 Datalog  
We have developed Possible Worlds Explorer (PWE), an open source Python-based toolkit that employs Jupyter notebooks to make working with Datalog and ASP systems easier and more productive.  ...  We provide containerized versions of PWE that can be run in the cloud or locally. We hope that in this way Datalog and ASP can be made more accessible for a wider audience.  ...  We have developed Possible Worlds Explorer (PWE) [17] , an open source, Python-based toolkit that aims to bring together the best of both worlds in order to serve a wide audience of users.  ... 
dblp:conf/datalog/GuptaCL19 fatcat:2choamhvw5b5xgzt6ufdsms3vi

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report) [article]

Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Markus Krötzsch, Bernhard Nebel, Marcel Steinmetz
2022 arXiv   pre-print
Here we address open-world state constraints formalized by planning over a description logic (DL) ontology.  ...  State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions.  ...  This is due to Datalog ¬ -rewritability, which allows us to reduce open-world to closed-world reasoning.  ... 
arXiv:2203.09361v1 fatcat:gdgkyfuipjhk5dmbcr5bnc5lrm
« Previous Showing results 1 — 15 out of 3,002 results