Sciweavers

3470 search results - page 177 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
AAMAS
2011
Springer
15 years 1 months ago
Reasoning about agent deliberation
We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL...
Natasha Alechina, Mehdi Dastani, Brian Logan, John...
GECCO
1999
Springer
15 years 10 months ago
Large Populations Are Not Always The Best Choice In Genetic Programming
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
Matthias Fuchs
AAAI
2008
15 years 8 months ago
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
Vladimir Lifschitz
LICS
1994
IEEE
15 years 10 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 10 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....