Sciweavers

288 search results - page 37 / 58
» Interactive Termination Proofs Using Termination Cores
Sort
View
CADE
2008
Springer
15 years 9 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ENTCS
2002
120views more  ENTCS 2002»
14 years 9 months ago
Composition of Distributed Software with Algon - Concepts and Possibilities
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
Judith Bishop, Karen Renaud, Basil Worrall
TLCA
2007
Springer
15 years 3 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
ISWC
2002
IEEE
15 years 2 months ago
A Wearable Computer for Support of Astronaut Extravehicular Activity
A wearable situational awareness terminal (WearSAT) that provides text, graphics, and video to an astronaut via a near-eye display, and acts as a client on a wireless network, has...
Christopher E. Carr, Steven J. Schwartz, Ilia Rose...
JAIR
2008
110views more  JAIR 2008»
14 years 9 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels