Sciweavers

844 search results - page 112 / 169
» Safraless Decision Procedures
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 9 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 8 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
ENTCS
2010
119views more  ENTCS 2010»
13 years 8 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
FUIN
2007
86views more  FUIN 2007»
13 years 8 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska
IANDC
2007
132views more  IANDC 2007»
13 years 8 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza