1688 search results - page 20 / 338 » The Complexity of Rationalizing Matchings |
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
LOGCOM
2010
13 years 6 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
FSTTCS
1994
Springer
13 years 11 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
EOR
2007
13 years 7 months ago
2007
Academic subjects made judgmental forecasts of a graphically presented time series in a laboratory experiment. Besides the past realizations of the time series itself, the only av...