Titlebook: Computer Science Logic; 17th International W Matthias Baaz,Johann A. Makowsky Conference proceedings 2003 Springer-Verlag Berlin Heidelberg

断言

Positive Games and Persistent Strategies,, given any finite or infinite run played on a game graph, each time the player visits some vertex already encountered, this player repeats the decision made when visiting this vertex for the first time. Such strategies require memory, but once a choice is made, it is made for ever. So, persistent s

orthodox

Generating All Abductive Explanations for Queries on Propositional Horn Theories,ing abductive explanations is an important problem, and there is a growing literature on this subject. We contribute to this endeavor by presenting new results on computing multiple resp. all of the possibly exponentially many explanations of an abductive query from a propositional Horn theory repre

vector

Tracheotomy

地名表

MONY

debase

Simple Stochastic Parity Games,states from which the single player has a strategy to achieve a Büchi objective with probability 1. For game graphs with . edges the algorithm works in time .. Interestingly, a similar technique sheds light on the question of the computational complexity of solving simple Büchi games and yields the

Delirium

Generating All Abductive Explanations for Queries on Propositional Horn Theories,ble in polynomial total time unless P = NP, which settles an open issue. However, we show how to compute under restriction to acyclic Horn theories polynomially many explanations in input polynomial time and all explanations in polynomial total time, respectively. Complementing and extending previou

kidney

单独