Sciweavers

509 search results - page 27 / 102
» On the completeness of compositional reasoning methods
Sort
View
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 1 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
CSL
2001
Springer
15 years 2 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
Frédéric Koriche
RR
2009
Springer
15 years 4 months ago
Distributed Resolution for Expressive Ontology Networks
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
Anne Schlicht, Heiner Stuckenschmidt
ATAL
1997
Springer
15 years 1 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
CIKM
2007
Springer
15 years 4 months ago
Reasoning about vague topological information
Topological information plays a fundamental role in the human perception of spatial configurations and is thereby one of the most prominent geographical features in natural langu...
Steven Schockaert, Martine De Cock