564 search results - page 61 / 113 » The First Answer Set Programming System Competition |
CONCUR
2006
Springer
14 years 11 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
ICDT
2010
ACM
14 years 11 months ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
ENTCS
2006
14 years 9 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
EUROSYS
2007
ACM
15 years 6 months ago
2007
ACM
In most modern operating systems, a process is a -protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms—dynamic code ...
100
click to vote
JIRS
2008
14 years 9 months ago
2008
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...