131 search results - page 8 / 27 » Complexity of the Satisfiability Problem for a Class of Prop... |
ECCC
2007
13 years 7 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
PPSN
1992
Springer
13 years 11 months ago
1992
Springer
The limitations of linear chromosomes and conventional recombination operators are reviewed. It is argued that there are at least three classes of problems for which such represen...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
IJCGA
2010
13 years 6 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...