Sciweavers

317 search results - page 44 / 64
» Reasoning about the Implementation of Concurrency Abstractio...
Sort
View
POPL
2009
ACM
16 years 2 months ago
The semantics of progress in lock-based transactional memory
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
Rachid Guerraoui, Michal Kapalka
AI
1998
Springer
15 years 1 months ago
Remote Agent: To Boldly Go Where No AI System Has Gone Before
Renewed motives for space exploration have inspired NASA to work toward the goal of establishing a virtual presence in space, through heterogeneous eets of robotic explorers. Info...
Nicola Muscettola, P. Pandurang Nayak, Barney Pell...
FLOPS
2004
Springer
15 years 5 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
JAR
1998
134views more  JAR 1998»
15 years 1 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
DLOG
2009
14 years 11 months ago
Explaining by Example: Model Exploration for Ontology Comprehension
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...
Johannes Bauer, Ulrike Sattler, Bijan Parsia