Sciweavers

756 search results - page 141 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
CADE
2009
Springer
15 years 10 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
APN
2010
Springer
15 years 2 months ago
Wendy: A Tool to Synthesize Partners for Services
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Niels Lohmann, Daniela Weinberg
AI
2000
Springer
14 years 9 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 1 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
AI
2007
Springer
14 years 9 months ago
From here to human-level AI
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...
John McCarthy