6167 search results - page 1189 / 1234 » Can Refinement be Automated |
ILP
2005
Springer
14 years 3 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
ILP
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we survey work being conducted at Imperial College on the use of machine learning to build Systems Biology models of the effects of toxins on biochemical pathways. Se...
LACL
2005
Springer
14 years 3 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
LOPSTR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Several models for context-sensitive analysis of modular programs have been proposed, each with different characteristics and representing different trade-offs. The ad...
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...