797 search results - page 51 / 160 » Eliminating Proofs from Programs |
100
click to vote
AAAI
1994
15 years 2 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
125
click to vote
NIPS
2003
15 years 2 months ago
2003
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
121
Voted
CADE
2003
Springer
16 years 1 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
106
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
123
click to vote
ALT
2004
Springer
15 years 9 months ago
2004
Springer
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...