منابع مشابه
Inductive Definitions in Constraint Programming
Constraint programming (CP) and answer set programming (ASP) are two declarative paradigms used to solve combinatorial problems. Many modern solvers for both these paradigms rely on partial or complete Boolean representations of the problem to exploit the extremely efficient techniques that have been developed for solving propositional satisfiability problems. This convergence on a common repre...
متن کاملInductive constraint logic programming: An overview
This paper provides a brief introduction and overview of the emerging area of Inductive Constraint Logic Programming (ICLP). It discusses some of the existing work in the area and presents some of the research issues and open questions that need to be addressed.
متن کاملUsing Constraint Satisfaction for Learning Hypotheses in Inductive Logic Programming
Inductive logic programming (ILP) is a subfield of machine learning which uses first-order logic as a uniform representation for examples, background knowledge and hypotheses (Muggleton and De Raedt, 1994). In this paper we deal with a so called template consistency problem, which is one of essential tasks in ILP (Gottlob et al 1999). In particular, given learning examples and template T, we ar...
متن کاملEfficient program synthesis using constraint satisfaction in inductive logic programming
We present NrSample, a framework for program synthesis in inductive logic programming. NrSample uses propositional logic constraints to exclude undesirable candidates from the search. This is achieved by representing constraints as propositional formulae and solving the associated constraint satisfaction problem. We present a variety of such constraints: pruning, input-output, functional (arith...
متن کاملLearning Constraint Grammar-style Disambiguation Rules using Inductive Logic Programming
This paper reports a pilot study, in which Constraint Grammar inspired rules were learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously tagged words were learnt for the part of speech tags of the Stockholm-Ume£ Corpus. Several thousand disambiguation rules were induced. When tested on unseen data, 98% of the words retained the correct reading after tag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Intelligent Systems
سال: 2017
ISSN: 1541-1672
DOI: 10.1109/mis.2017.265115706