787 search results - page 108 / 158 » Polynomial Constants are Decidable |
ESWS
2009
Springer
14 years 4 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— A predictive outage compensator co-located with the actuator node in a networked control system can be used to counteract unpredictable losses of data in the feedback control l...
IWPSE
2007
IEEE
14 years 3 months ago
2007
IEEE
We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each v...
LPNMR
2007
Springer
14 years 3 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
LPNMR
2005
Springer
14 years 3 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...