934 search results - page 159 / 187 » Elementary Sets of Logic Programs |
168
Voted
AAAI
1994
15 years 7 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
155
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
167
Voted
FOSSACS
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
169
Voted
CSL
2007
Springer
16 years 10 days ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
200
Voted
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...