29 search results - page 6 / 6 » Proving Termination for Logic Programs by the Query-Mapping ... |
POPL
2011
ACM
12 years 8 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
PPDP
2007
Springer
13 years 11 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
CLIMA
2004
13 years 6 months ago
2004
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...