52 search results - page 3 / 11 » Defining Datalog in Rewriting Logic |
99
Voted
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
94
Voted
AGP
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
94
Voted
PODS
2010
ACM
15 years 17 hour ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
DLOG
2009
14 years 8 months ago
2009
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
CADE
2003
Springer
15 years 10 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...