583 search results - page 105 / 117 » Preferences in Answer Set Programming |
114
click to vote
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
AAAI
2007
14 years 12 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
SPLC
2000
14 years 11 months ago
2000
: We consider a set of programs a family when it pays to look at their common aspects before looking at their differences. For commercial software developers the implications are t...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...