727 search results - page 6 / 146 » A Method for Implementing Equational Theories as Logic Progr... |
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
ENTCS
2007
13 years 7 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
ICALP
2007
Springer
13 years 11 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...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
AAAI
1994
13 years 8 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...