3738 search results - page 263 / 748 » Parametrized Logic Programming |
138
click to vote
AAAI
2006
15 years 5 months ago
2006
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...
153
click to vote
RR
2010
Springer
15 years 2 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...
158
click to vote
ESOP
2007
Springer
15 years 10 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...
106
click to vote
ICALP
2010
Springer
15 years 9 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 ...
129
click to vote
ICLP
1999
Springer
15 years 8 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...