Sciweavers

590 search results - page 35 / 118
» From Relational Specifications to Logic Programs
Sort
View
AGP
2010
IEEE
14 years 1 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
AIIA
2007
Springer
14 years 3 months ago
A Top Down Interpreter for LPAD and CP-Logic
Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a...
Fabrizio Riguzzi
IJCAI
2001
13 years 10 months ago
Mining Soft-Matching Rules from Textual Data
Text mining concerns the discovery of knowledge from unstructured textual data. One important task is the discovery of rules that relate specific words and phrases. Although exist...
Un Yong Nahm, Raymond J. Mooney
PODS
1989
ACM
129views Database» more  PODS 1989»
14 years 25 days ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
COLT
1994
Springer
14 years 27 days ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton