2585 search results - page 376 / 517 » Automating Coherent Logic |
184
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
143
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime...
162
click to vote
TIME
2007
IEEE
16 years 23 days ago
2007
IEEE
Computer science has long been considered to emphasize three distinct perspectives: mathematics, science, and engineering. While the database field has some very strong mathemati...
179
click to vote
TIME
2007
IEEE
16 years 23 days ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
199
click to vote
TIME
2007
IEEE
16 years 23 days ago
2007
IEEE
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...