1313 search results - page 104 / 263 » Prioritized Reasoning in Logic Programming |
103
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. The generation of redundant hypotheses ma...
104
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
128
Voted
PEPM
2010
ACM
16 years 14 days ago
2010
ACM
We present two tools which together allow reasoning about (a substantial subset of) Haskell programs. One is the code generator of the proof assistant Isabelle, which turns speci...
133
Voted
SLP
1994
15 years 4 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
131
Voted
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. The Nuprl system is a framework for reasoning about mathematics and programming. Over the years its design has been substantially improved to meet the demands of large-sc...