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.
Filters
Defining Datalog in Rewriting Logic
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
Experimental results show that the performance of solving Datalog queries in rewriting logic is comparable to state-of-the-art Datalog solvers. ...
By exploiting the power of the Rewriting Logic language Maude, we aim at transforming Datalog programs into efficient rewrite systems that compute the same answers. ...
Since variables in rewriting logic are input-only parameters, we cannot use them to encode logic variables of Datalog. ...
doi:10.1007/978-3-642-12592-8_14
fatcat:45ornu5mxjajxe34kzfmm4246u
A Modal Logic for Joint Abilities under Strategy Commitments
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
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.
In this paper, we propose JAADL, a modal logic for joint abilities under strategy commitments, which is an extension of ATL. ...
We analyze valid formulas in JAADL, give sufficient/necessary conditions for joint abilities, and show that model checking memoryless JAADL is in EXPTIME. ...
For a logical expression υ, let υσ be the result of replacing each variable x in υ by σ(x) if the latter is defined. ...
doi:10.24963/ijcai.2020/246
dblp:conf/ijcai/CarralK20
fatcat:biobkota7fgr7ccnediiu2e45a
The DReW System for Nonmonotonic DL-Programs
[chapter]
2013
Springer Proceedings in Complexity
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 addition to DL-programs, DReW can also answer conjunctive queries under DL-safeness conditions over Datalog-rewritable ontologies, as well as reason on terminological default logics over such ontologies ...
We developed the reasoner DReW that uses the Datalog-rewriting technique. ...
For Datalog-rewritable DLs, the instance query problem can be reduced to the query in Datalog. The DL component Σ in Example 1 is in OWL 2 RL, which is Datalog-rewritable. ...
doi:10.1007/978-1-4614-6880-6_33
dblp:conf/csemws/XiaoEH12
fatcat:ps5d2sroevedzabpfssizprow4
Datalog as a pointcut language in aspect-oriented programming
2006
Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '06
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 solve expressiveness, termination and verbosity by using Datalog plus rewrite rules. ...
Acknowledgments This research has been supported, in part, by EPSRC in the United Kingdom. ...
To support the claim of expressiveness, we demonstrate that the problematic example presented in earlier works on logic pointcuts and discussed below can be nicely expressed in Datalog. ...
doi:10.1145/1176617.1176664
dblp:conf/oopsla/HajiyevOAMSTV06
fatcat:flf2rhnwyjecrdgmmiblpcsnmi
Semantic Integration of Relational Data Using SPARQL
2008
2008 Second International Symposium on Intelligent Information Technology Application
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.
A query rewriting algorithm based on Datalog is also provided for heterogeneous data integration. ...
The formal semantics of SPARQL is defined according to the W3C Candidate Recommendation and translation algorithm from SPARQL to Datalog is provided. ...
The architecture and approach we provided in this paper can be extended for other data source (i.e. XML, RDF, web forms, etc.); some of the complex semantic (i.e. CONSTURCT, ASK) are not discussed. ...
doi:10.1109/iita.2008.72
fatcat:a23o54cwpvakfpq3iw6xt3pn5e
Datalog-Based Program Analysis with BES and RWL
[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.
In order to improve scalability and to enable analyses involving advanced meta-programming features, we develop a second methodology that transforms Datalog programs into rewriting logic (Rwl) theories ...
The first technique transforms Datalog programs into an implicit Boolean Equation System (Bes) that can then be solved by using linear-time complexity algorithms that are available in existing, general ...
We are grateful to Fernando Tarín and Adam Kepa for their valuable contributions to the experiments shown in this paper. ...
doi:10.1007/978-3-642-24206-9_1
fatcat:o7y7uiehyrgflhobl2dmdokv64
Uniform Evaluation of Nonmonotonic DL-Programs
[chapter]
2012
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.
In this paper, we consider recent and ongoing work on this approach which uses relational first-order logic (and thus relational database engines) and datalog with negation as target formalisms. ...
Nonmonotonic description logic programs are a major formalism for a loose coupling of rules and ontologies, formalized in logic programming and description logics, respectively. ...
Note that strictly, Φ EL (L) is not a datalog rewriting as defined above. ...
doi:10.1007/978-3-642-28472-4_1
fatcat:4mh6a2dg4bfztpmd2zwsfxx7yi
Semantics of static pointcuts in aspectJ
2007
SIGPLAN notices
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 2006; you can also visit the original URL.
The file type is application/pdf.
The translation from pointcuts to safe Datalog consists of a set of simple conditional rewrite rules, implemented using the Stratego system. ...
Safe Datalog is a logic language like Prolog, but it does not have data structures; consequently it has a straightforward least fixpoint semantics and all queries terminate. ...
He also patiently incorporated numerous bug fixes and change requests into the AspectJ grammar in Stratego. ...
doi:10.1145/1190215.1190221
fatcat:5qrjwelod5a3vi7od3lw57di5q
Semantics of static pointcuts in aspectJ
2007
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '07
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 2006; you can also visit the original URL.
The file type is application/pdf.
The translation from pointcuts to safe Datalog consists of a set of simple conditional rewrite rules, implemented using the Stratego system. ...
Safe Datalog is a logic language like Prolog, but it does not have data structures; consequently it has a straightforward least fixpoint semantics and all queries terminate. ...
He also patiently incorporated numerous bug fixes and change requests into the AspectJ grammar in Stratego. ...
doi:10.1145/1190216.1190221
dblp:conf/popl/AvgustinovHOMSTV07
fatcat:vgzeblbkibgupo22sepxkwxtva
Large-scale Ontological Reasoning via Datalog
[article]
2020
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.
Ontological reasoning for many fragments of OWL 2 can be reduced to the evaluation of Datalog queries. ...
This paper surveys some of these compilations, and in particular the one addressing queries over Horn-SHIQ knowledge bases and its implementation in DLV2 enanched by a new version of the Magic Sets algorithm ...
Conclusion The semantics of many constructs of Description Logics is defined in terms of First-Order Logic expressions, and these expressions are often naturally expressible in Datalog. ...
arXiv:2003.09698v1
fatcat:6ahlgmgjorg6rha6zzgpyip5sm
Inline Evaluation of Hybrid Knowledge Bases
[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.
Note that strictly, Φ EL (L) is not a Datalog rewriting as defined in Definition 4.1. ...
We abstractly define which DLs we consider Datalog-rewritable. ...
doi:10.1007/978-3-642-23580-1_28
fatcat:xnzzbf2imngshokm36ni5vuzni
Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
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 2018; you can also visit the original URL.
The file type is application/pdf.
rewritability into first-order logic). ...
rewritings when they exist, and prove that there is no constant bound on the arity of IDB relations in linear Datalog rewritings. ...
We say that Q is (linear) Datalog-rewritable if there is a (linear) Datalog program that is a rewriting of Q. It is well-known that, in EL, all OMQs are Datalog-rewritable. ...
doi:10.24963/ijcai.2017/164
dblp:conf/ijcai/LutzS17
fatcat:ldphn3dh5fauxo673haua7idr4
Rewrite and Conquer: Dealing with Integrity Constraints in Data Integration
[chapter]
2013
Seminal Contributions to Information Systems Engineering
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.
The work "Data Integration under Integrity Constraints", published at the CAiSE 2002 Conference, proposes a rewriting technique for answering queries in data integration systems, when the global schema ...
In this addendum, we explain why this research was important and how it gave rise to several results in the following years. A. Calì ( ) ...
Sticky sets of TGDs, or sticky Datalog˙ [6] , are defined by an easily testable syntactic condition, and are obviously first-order rewritable. Extension of sticky Datalogȧ re also studied in [6] . ...
doi:10.1007/978-3-642-36926-1_28
fatcat:ldze5kvp4bfhfccyl5moadrdti
Extending the power of datalog recursion
2012
The VLDB journal
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.
Supporting aggregates in recursive logic rules represents a very important problem for Datalog. ...
Thus, Datalog F S enables the efficient formulation of queries that could not be expressed efficiently or could not be expressed at all in Datalog with stratified negation and aggregates. ...
We will next define the semantics of Running-FS goals and multi-occurring predicates by their rewriting into logic programs. ...
doi:10.1007/s00778-012-0299-1
fatcat:mf2jbhemqjaateedxvffa5njja
Datalog access to real-world web services
2018
Figshare
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.
Presentation slides of Logic for Dynamic Real-World Information Workshop, UNILOG 2018, Vichy, France, 25 June 2018 ...
Queries over global schema must be translated to
API operation calls
Mediation approach in case of Web
Services: Query Evaluation
Datalog Engine
Evaluation of query generated by query rewriting ...
query
Datalog query
Advantages
Declarative languages (Focus on what and not
on how)
Similar to SELECT-PROJECT-JOIN (SPJ) SQL
queries
Query rewriting
Definition
Translation of queries formulated ...
doi:10.6084/m9.figshare.6707420.v1
fatcat:ucyfcr2i3rgkhczf4zyu64dera
« Previous
Showing results 1 — 15 out of 2,224 results