Sciweavers

227 search results - page 19 / 46
» A Model Theory for Paraconsistent Logic Programming
Sort
View
CADE
2008
Springer
14 years 8 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...
ATAL
2006
Springer
14 years 7 days ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
AMAI
2006
Springer
13 years 8 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ENTCS
2007
144views more  ENTCS 2007»
13 years 8 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
FLAIRS
2000
13 years 9 months ago
Domain Semantics for Agent-Oriented Programming
This paper describes a novel semantic framework for an agent architecture. Drawing on Shoham's work on AGENT0 (Shoham 1993), we replace Shoham's modal logic semantics wi...
Roger Norton, S. Rebecca Thomas