191 search results - page 6 / 39 » A Reasoner for Simple Conceptual Logic Programs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
AAAI
2007
13 years 10 months ago
2007
We present a sound and complete logic for reasoning about SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL designed for the implementation of cog...
LICS
2002
IEEE
14 years 18 days ago
2002
IEEE
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...