Sciweavers

5216 search results - page 435 / 1044
» Planning as Model Checking
Sort
View
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 5 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
ACL
1994
15 years 8 months ago
A Hybrid Reasoning Model for Indirect Answers
This paper presents our implemented computational model for interpreting and generating indirect answers to Yes-No questions. Its main features are 1) a discourse-plan-based appro...
Nancy Green, Sandra Carberry
RTCSA
1999
IEEE
15 years 11 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
DLT
2009
15 years 4 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano
RTAS
2006
IEEE
16 years 23 days ago
Scalable Modeling and Performance Evaluation of Wireless Sensor Networks
A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state...
YoungMin Kwon, Gul Agha