116 search results - page 15 / 24 » Reasoning Symbolically About Partially Matched Cases |
IJCAI
2007
14 years 11 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
101
click to vote
CONCUR
1997
Springer
15 years 1 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
101
click to vote
PLDI
2011
ACM
14 years 10 days ago
2011
ACM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
90
Voted
AAAI
2004
14 years 11 months ago
2004
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
78
Voted
AIML
2006
14 years 11 months ago
2006
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...