142 search results - page 21 / 29 » On the Existence of Answer Sets in Normal Extended Logic Pro... |
ESWS
2009
Springer
14 years 2 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...
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...