Sciweavers

1157 search results - page 37 / 232
» Descriptive Complexity and Model Checking
Sort
View
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 8 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
AI
2005
Springer
13 years 7 months ago
Knowledge updates: Semantics and complexity issues
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
Chitta Baral, Yan Zhang
GEOINFORMATICA
2011
13 years 2 months ago
Functional description of geoprocessing services as conjunctive datalog queries
Discovery of suitable web services is a crucial task in Spatial Data Infrastructures (SDI). In this work, we develop a novel approach to the discovery of geoprocessing services (WP...
Daniel Fitzner, Jörg Hoffmann, Eva Klien
CAISE
2004
Springer
14 years 1 months ago
Description Logics for Interoperability
tween documents. They should allow for an abstract representation of data which resembles the way they are actually perceived and used in the real world, thus shortening (with resp...
Enrico Franconi
CONCUR
2007
Springer
14 years 1 months ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi