Sciweavers

798 search results - page 85 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
SYNTHESE
2008
114views more  SYNTHESE 2008»
13 years 7 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
SIAMCOMP
2008
100views more  SIAMCOMP 2008»
13 years 7 months ago
On the Complexity of Verifying Consistency of XML Specifications
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
Marcelo Arenas, Wenfei Fan, Leonid Libkin
STACS
1994
Springer
13 years 11 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
ICALP
2011
Springer
12 years 11 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
ICSE
2007
IEEE-ACM
14 years 7 months ago
Sequential Circuits for Relational Analysis
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid