1143 search results - page 219 / 229 » Abstract Syntax and Logic Programming |
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
AUSAI
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
DFG
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Today's manufacturing industry demands flexible and decentralized production control systems to avoid hours of down time of the production line in case of a failure ...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...