Sciweavers

1342 search results - page 17 / 269
» Ordered Programs as Abductive Systems
Sort
View
FSTTCS
2010
Springer
14 years 9 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
FOSSACS
2007
Springer
15 years 5 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
ILP
2003
Springer
15 years 4 months ago
ILP for Mathematical Discovery
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
Simon Colton, Stephen Muggleton
98
Voted
POPL
2010
ACM
15 years 9 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
FUIN
2006
95views more  FUIN 2006»
14 years 11 months ago
Multistrategy Operators for Relational Learning and Their Cooperation
Traditional Machine Learning approaches based on single inference mechanisms have reached their limits. This causes the need for a framework that integrates approaches based on aba...
Floriana Esposito, Nicola Fanizzi, Stefano Ferilli...