Sciweavers

96 search results - page 2 / 20
» A Short Survey of Automated Reasoning
Sort
View
CSL
2008
Springer
13 years 7 months ago
The Computability Path Ordering: The End of a Quest
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
Frédéric Blanqui, Jean-Pierre Jouann...
ICTL
1994
13 years 9 months ago
A Survey of Concurrent METATEM - the Language and its Applications
In this paper we present a survey of work relating to the Concurrent METATEM programming language. In addition to a description of the basic Concurrent METATEM system, which incorp...
Michael Fisher
TIME
2008
IEEE
14 years 4 days ago
Temporal Description Logics: A Survey
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
Carsten Lutz, Frank Wolter, Michael Zakharyaschev
FLOPS
2006
Springer
13 years 9 months ago
A Computational Approach to Pocklington Certificates in Type Theory
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
Benjamin Grégoire, Laurent Théry, Be...
IJCAI
2003
13 years 7 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov