4192 search results - page 299 / 839 » Probabilistic Logic Programming |
195
click to vote
ESOP
2007
Springer
16 years 20 days 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...
135
click to vote
ICALP
2010
Springer
15 years 11 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 ...
161
click to vote
ICLP
1999
Springer
15 years 10 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...
165
click to vote
INFORMATICALT
2000
15 years 6 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:...
171
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...