648 search results - page 52 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
131
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
116
click to vote
ASP
2001
Springer
15 years 6 months ago
2001
Springer
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
106
click to vote
FUIN
2010
14 years 12 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
109
click to vote
PLDI
2009
ACM
15 years 8 months ago
2009
ACM
Taint analysis, a form of information-flow analysis, establishes whether values from untrusted methods and parameters may flow into security-sensitive operations. Taint analysis...