Sciweavers

947 search results - page 39 / 190
» Declarative Programming in Prolog
Sort
View
AAAI
2007
14 years 12 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ICML
1989
IEEE
15 years 1 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
15 years 1 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
ICLP
2009
Springer
15 years 10 months ago
Generative Modeling by PRISM
PRISM is a probabilistic extension of Prolog. It is a high level language for probabilistic modeling capable of learning statistical parameters from observed data. After reviewing ...
Taisuke Sato
103
Voted
PADL
2012
Springer
13 years 5 months ago
Recent Advances in Declarative Networking
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
Boon Thau Loo, Harjot Gill, Changbin Liu, Yun Mao,...