3566 search results - page 237 / 714 » Signed Logic Programs |
109
click to vote
RR
2010
Springer
14 years 10 months ago
2010
Springer
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...
118
click to vote
ESOP
2007
Springer
15 years 5 months ago
2007
Springer
We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and valida...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
99
Voted
ICLP
1999
Springer
15 years 4 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
INFORMATICALT
2000
14 years 11 months ago
2000
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...