8413 search results - page 53 / 1683 » Ordering Problem Subgoals |
CADE
2007
Springer
14 years 8 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
FLAIRS
2007
13 years 10 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
AI
2006
Springer
13 years 8 months ago
2006
Springer
This paper demonstrates how machine learning methods can be applied to deal with a realworld decipherment problem where very little background knowledge is available. The goal is ...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...