143 search results - page 7 / 29 » Fixed-Parameter Complexity of Semantics for Logic Programs |
110
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
AAAI
2004
14 years 11 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
ML
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...