3845 search results - page 177 / 769 » Belief Logic Programming |
79
Voted
EPIA
2005
Springer
15 years 3 months ago
2005
Springer
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
ICLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
96
Voted
LPNMR
2001
Springer
15 years 2 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
85
Voted
COLING
1992
14 years 11 months ago
1992
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
88
Voted
DIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...