Sciweavers

187 search results - page 5 / 38
» On Expressive and Model Checking Power of Propositional Prog...
Sort
View
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 6 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
CAV
2007
Springer
110views Hardware» more  CAV 2007»
14 years 1 months ago
Hector: Software Model Checking with Cooperating Analysis Plugins
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
Nathaniel Charlton, Michael Huth
ATAL
2005
Springer
14 years 1 months ago
On the dynamics of delegation, cooperation, and control: a logical account
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
Wiebe van der Hoek, Michael Wooldridge
KBSE
2005
IEEE
14 years 1 months ago
Properties and scopes in web model checking
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
May Haydar, Sergiy Boroday, Alexandre Petrenko, Ho...
LPNMR
2004
Springer
14 years 1 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
Thomas Eiter, Axel Polleres