52 search results - page 8 / 11 » Defining Datalog in Rewriting Logic |
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
BDA
2004
13 years 8 months ago
2004
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
WFLP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...