438 search results - page 77 / 88 » On theorem proving in annotated logics |
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
FMSD
2006
14 years 9 months ago
2006
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
106
click to vote
CADE
2012
Springer
13 years 1 days ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
171
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
117
click to vote
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...