3513 search results - page 234 / 703 » Super Logic Programs |
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...
132
click to vote
INFORMATICALT
2000
15 years 4 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:...
142
click to vote
ATAL
2007
Springer
15 years 8 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...
128
click to vote
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...