52 search results - page 2 / 11 » Defining Datalog in Rewriting Logic |
172
click to vote
JAPLL
2010
15 years 2 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
135
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
175
click to vote
SEBD
2001
15 years 5 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
150
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
160
click to vote
CSFW
2003
IEEE
15 years 9 months ago
2003
IEEE
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...