Sciweavers

114 search results - page 6 / 23
» Mind Change Complexity of Learning Logic Programs
Sort
View
COMMA
2008
13 years 10 months ago
Requirements for reflective argument visualization tools: A Case for Using Validity as a Normative Standard
This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to...
Michael H. G. Hoffmann
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
XSB: Extending Prolog with Tabled Logic Programming
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...
Terrance Swift, David Scott Warren
ICDAR
2009
IEEE
14 years 3 months ago
Inductive Logic Programming for Symbol Recognition
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 ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
ICSM
1998
IEEE
14 years 29 days ago
Detection of Logical Coupling Based on Product Release History
Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems--those consisting of several millions of...
Harald Gall, Karin Hajek, Mehdi Jazayeri
ML
2006
ACM
122views Machine Learning» more  ML 2006»
13 years 8 months ago
PRL: A probabilistic relational language
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 ...
Lise Getoor, John Grant