Sciweavers

7075 search results - page 307 / 1415
» Models and heterogeneous reasoning
Sort
View
ECAI
1998
Springer
15 years 11 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
CSL
2002
Springer
15 years 6 months ago
A conversation acts model for generating spoken dialogue contributions
In this paper, we describe a generation system for spoken dialogue that not only produces coherent, informative and responsive dialogue contributions, but also explicitly models h...
Amanda Stent
185
Voted
LPAR
2010
Springer
15 years 5 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen
CADE
2008
Springer
16 years 7 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
FM
2001
Springer
142views Formal Methods» more  FM 2001»
15 years 11 months ago
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
Marsha Chechik, Steve M. Easterbrook, Victor Petro...