Sciweavers

622 search results - page 19 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
DAC
2006
ACM
14 years 9 months ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
14 years 2 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt
HIS
2009
13 years 5 months ago
Implementing and Evaluating a Rule-Based Approach to Querying Regular EL+ Ontologies
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
Yuting Zhao, Jeff Z. Pan, Yuan Ren
CADE
2002
Springer
14 years 8 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ESAW
2006
Springer
13 years 11 months ago
Current Issues in Multi-Agent Systems Development
Abstract. This paper surveys the state-of-the-art in developing multi-agent systems, and sets out to answer the questions: "what are the key current issues in developing multi...
Rafael H. Bordini, Mehdi Dastani, Michael Winikoff