5198 search results - page 375 / 1040 » A Logic of Agent Programs |
138
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 ...
164
click to vote
ICLP
1999
Springer
15 years 11 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...
168
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:...
209
click to vote
AIPS
2009
15 years 7 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
160
click to vote
APLAS
2010
ACM
15 years 7 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...