Filters








64,432 Hits in 3.7 sec

Learning and verifying quantified boolean queries by example

Azza Abouzied, Dana Angluin, Christos Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz
2013 Proceedings of the 32nd symposium on Principles of database systems - PODS '13  
In this paper, we analyze the number of questions needed to learn or verify qhorn queries, a special class of Boolean quantified queries whose underlying form is conjunctions of quantified Horn expressions  ...  We provide optimal polynomial-question and polynomial-time learning and verification algorithms for two subclasses of the class qhorn with upper constant limits on a query's causal density.  ...  Learning universal Horn expressions We first determine head variables of universal Horn expressions. We use the same algorithm of ( §3.1.1). The algorithm uses O(n) questions.  ... 
doi:10.1145/2463664.2465220 dblp:conf/pods/AbouziedAPHS13 fatcat:r6oayo3ecfdsllj4wopzo7ccq4

Learning and Verifying Quantified Boolean Queries by Example [article]

Azza Abouzied and Dana Angluin and Christos Papadimitriou and Joseph M. Hellerstein and Avi Silberschatz
2013 arXiv   pre-print
In this paper, we analyze the number of questions needed to learn or verify qhorn queries, a special class of Boolean quantified queries whose underlying form is conjunctions of quantified Horn expressions  ...  We provide optimal polynomial-question and polynomial-time learning and verification algorithms for two subclasses of the class qhorn with upper constant limits on a query's causal density.  ...  Acknowledgments Partial funding provided by NSF Grants CCF-0963922, CCF-0916389, CC-0964033 and a Google University Research Award.  ... 
arXiv:1304.4303v1 fatcat:pl5e57prdfc5nc6fmu57ctjuz4

Learning Function-Free Horn Expressions

Roni Khardon
1999 Machine Learning  
The problem of learning universally quantified function free first order Horn expressions is studied.  ...  We present learning algorithms for all these tasks for the class of universally quantified function free Horn expressions.  ...  Preliminaries First-order Horn expressions We consider a subset of the class of universally quantified expressions in first-order logic.  ... 
doi:10.1023/a:1007610422992 dblp:journals/ml/Khardon99a fatcat:wjejfr724jcqzcffrmiikl4n2u

Thought without naming

Martha Peláez-Nogueras
1996 Journal of The Experimental Analysis of Behavior  
First, according to Horne and Lowe, naming appears to involve a higher order behavioral relation that is both evoked by,  ...  Given Horne and Lowe's ambitious claims and conclusions, several important issues need to be addressed.  ...  First, according to Horne and Lowe, naming appears to involve a higher order behavioral relation that is both evoked by, This article was written while the author was visiting professor at the University  ... 
doi:10.1901/jeab.1996.65-299 pmid:16812799 pmcid:PMC1350094 fatcat:poh3ekivt5cy3faxnzw4czg6au

Learning Higher-Order Programs through Predicate Invention

Andrew Cropper, Rolf Morel, Stephen H. Muggleton
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs.  ...  Our experiments show that, compared to first-order programs, learning higher-order programs can significantly improve predictive accuracies and reduce learning times.  ...  Figure 5 : 5 Higher-order map definition. The variables are all universally quantified first-order variables except the symbol F , which is a higher-order variable.  ... 
doi:10.1609/aaai.v34i09.7113 fatcat:zdrgupv6kffvrc6oqnxaigod34

Page 681 of American Journal of Education Vol. 7, Issue 18 [page]

1859 American Journal of Education  
My services are only the first bending of the shovel-handle, and the fastening of it toa new horn. But why doI speak by similitudes?  ...  , this order of suc- cession, viz. :— a.  ... 

Complexity Parameters for First-Order Classes [chapter]

Marta Arias, Roni Khardon
2003 Lecture Notes in Computer Science  
We study several complexity parameters for first order formulas and their suitability for first order learning models.  ...  We consider universally quantified first order Horn expressions. A clause is a disjunction of literals where all variables in the clause are (implicitly) universally quantified.  ...  Suppose that E is a first order Horn expression s.t.  ... 
doi:10.1007/978-3-540-39917-9_4 fatcat:r3bnlglvbzhhpowit3u4v6z2ey

Page 1658 of Psychological Abstracts Vol. 87, Issue 5 [page]

2000 Psychological Abstracts  
—The problem of learning universally quantified function free first order Horn expressions is studied.  ...  The author presents learning algorithms for all these tasks for the class of universally quantified function free Horn expressions.  ... 

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization [chapter]

Scott Dietzen, Frank Pfenning
1989 Proceedings of the Sixth International Workshop on Machine Learning  
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 is not well suited to application  ...  We explore the use of a higher-order representation language and extend EBG to a higher-order logic programming language.  ...  When higher-order domains are expressed in first-order languages, reasoning and programming over these ad hoc encodings is difficult: We often need "new variables", need to check conditions such as "where  ... 
doi:10.1016/b978-1-55860-036-2.50113-2 fatcat:3bqhfgx3fra2hid4vlyixbu7zm

Influences of Frege's Predicate Logic on Some Computational Models

Mohamad Awwad
2018 Future Human Image  
form of the expressions.  ...  This system, that mainly encompasses first order logic (FOL), introduces the notion of universal quantifiers, and implicitly that of existential quantifiers, allows performing any deduction based on the  ...  Shulz at Technical University of Munich. It is a full first-order logic prover, but built on a purely equational calculus.  ... 
doi:10.29202/fhi/9/1 fatcat:zfn5mgjsinfljdc2sucqf6rori

Higher-order and modal logic as a framework for explanation-based generalization

Scott Dietzen, Frank Pfenning
1992 Machine Learning  
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 is not well suited to application  ...  We explore the use of a higher-order representation language and extend EBG to a higher-order logic programming language.  ...  When higher-order domains are expressed in first-order languages, reasoning and programming over these ad hoc encodings is difficult: We often need "new variables", need to check conditions such as "where  ... 
doi:10.1007/bf00993253 fatcat:4endxrh4kzepdm6wdtjrynmlba

Normal forms for inductive logic programming [chapter]

Peter A. Flach
1997 Lecture Notes in Computer Science  
First, we show that in the propositional case induction from complete evidence can be seen as an equivalence-preserving transformation from DNF to CNF.  ...  Because ENF is incomplete, in the sense that it does not have the expressive power of clausal logic, ENF evidence requires the identification of Skolem terms.  ...  We explore the prospects of such a reformulation approach for inducing universal CNF formulae (first-order clausal theories) from evidence expressed in a suitable normal form.  ... 
doi:10.1007/3540635149_43 fatcat:57kpgrgsnfhxxaaiq7sdx5y3r4

Complexity parameters for first order classes

Marta Arias, Roni Khardon
2006 Machine Learning  
We study several complexity parameters for first order formulas and their suitability for first order learning models.  ...  We then identify an alternative notion of size and a simple set of parameters that are useful for first order Horn Expressions.  ...  We consider universally quantified first order Horn expressions. A clause is a disjunction of literals where all variables in the clause are (implicitly) universally quantified.  ... 
doi:10.1007/s10994-006-8261-3 fatcat:u5zmuagkhzdf3o4nihdrlitn2e

The appropriateness of predicate invention as bias shift operation in ILP

Irene Stahl
1995 Machine Learning  
However, whether predicate invention really helps to make learning succeed in the extended language depends on the language bias currently employed.  ...  The task of predicate invention in Inductive Logic Programming is to extend the hypothesis language with new predicates if the vocabulary given initially is insufficient for the learning task.  ...  Undecidability for First Order Horn Logic Though first order Horn logic is less expressive than full clausal logic, it still does not allow for deciding logical entailment.  ... 
doi:10.1007/bf00993476 fatcat:bysxsda7dvbbdhudofo65ppo74

Forthcoming Papers

2004 Artificial Intelligence  
These sorted logics lead to useful expressions and inference methods for structural knowledge that ordinary first-order logic lacks.  ...  Kaneiwa, Order-sorted logic programming with predicate hierarchy Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy  ...  Part II: generalized expected utility as a universal decision rule  ... 
doi:10.1016/s0004-3702(04)00105-5 fatcat:iwtjlaxhxvftresqkfs7ecr22m
« Previous Showing results 1 — 15 out of 64,432 results