Víctor Dalmau, Peter Jeavons  Home/Search
Context Related
| lsi.upc.es/~dalmau/lqf.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: lsi.upc.es/~dalmau/Papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the following classes of quantified formulas. Fix a set of basic relations called a basis. Take conjunctions of these basic relations applied to variables and constants in arbitrary ways. Finally, quantify existentially or universally some of the variables. We introduce some conditions on the basis that guarantee efficient learnability. Furthermore, we show that with certain restrictions on the basis the classification is complete. We introduce, as an intermediate tool, a link... (Update)
Context of citations to this paper: More
.... tractable families known so far in the framework of closure functions is: 1) near unanimity problems [14] 2) coset generating problems [5, 6], including the class of affine problems [17] and (3) width 1 problems [7] 1 2 V ICTOR DALMAU including some important class of...
.... problems such as satisfiability, tautology and counting problems of boolean formulas [23] learnability of quantified formulas [9] and Constraint Satisfaction Problems [13, 14, 15, 16, 12] Finally we mention some similar results: a dichotomy result for...
Cited by: More
Closure Functions and Width 1 Problems - Dalmau, Pearson (1999) (Correct)
Boolean Formulas are Hard to Learn for Most - Gate Bases Ictor (Correct)
A New Tractable Class Of Constraint Satisfaction Problems - Dalmau (2000) (Correct)
Active bibliography (related documents): More All
0.8: A Dichotomy Theorem for Learning Quantified Boolean Formulas - Dalmau (1997) (Correct)
0.5: Constraint Satisfaction Problems In - Non-Deterministic Logarithmic Space (Correct)
0.5: Clones Preserving a Quasi-Order - Andrei Krokhin (Correct)
Similar documents based on text: More All
0.4: Tractable Constraints Closed Under A Binary Operation - Bulatov (2000) (Correct)
0.3: An Algebraic Approach To Multi-Sorted Constraints - Bulatov (2003) (Correct)
0.2: Phase Transitions of PP-Complete Satisfiability Problems - Bailey, Dalmau, Kolaitis (Correct)
Related documents from co-citation: More All
3: A unifying framework for tractable constraints - Jeavons, Cohen et al. - 1995
3: Closure properties of constraints - Jeavons, Cohen et al. - 1997
3: The complexity of satisfiability problems (context) - Schaefer - 1978
BibTeX entry: (Update)
V. Dalmau and P. Jeavons. Learnability of Quantified Formulas. In 4th European Conference on Computational Learning Theory Eurocolt'99, volume 1572 of Lecture Notes in Artificial Intelligence, pages 63--78, Berlin/New York, 1999. Springer-Verlag. http://citeseer.ist.psu.edu/dalmau99learnability.html More
@article{ dalmau99learnability,
author = "V{\'\i}ctor Dalmau and Peter Jeavons",
title = "Learnability of Quantified Formulas",
journal = "Lecture Notes in Computer Science",
volume = "1572",
pages = "63--78",
year = "1999",
url = "citeseer.ist.psu.edu/dalmau99learnability.html" }
Citations (may not include all citations):537 A Theory of the Learnable (context) - Valiant - 1984
441 Queries and Concept Learning (context) - Angluin - 1988
388 Inductive Logic Programming - Muggleton - 1992
313 Inductive Logic Programming: Theory and Methods - Muggleton, De Raedt - 1994
184 Cryptographic limitations on learning Boolean formulae and f.. - Kearns, Valiant - 1994
127 The Complexity of Satisfiability Problems (context) - Schaefer - 1978
84 Learning Conjunctions of Horn Clauses - Angluin, Frazier et al. - 1992
82 When won't Membership Queries help (context) - Angluin, Kharitonov - 1995
62 The Computational Structure of Monotone Monadic SNP and Cont.. - Feder, Vardi - 1998
59 Prediction-Preserving Reducibility (context) - Pitt, Warmuth - 1990
46 An Efficient Membership-query Algorithm for Learning DNF wit.. - Jackson - 1997
33 Closure Properties of Constraints - Jeavons, Cohen et al. - 1997
33 A Unifying Framework for Tractable Constraints - Jeavons, Cohen et al. - 1995
29 Learning Nested Differences of Intersection-Closed Concept C.. (context) - Helmbold, Sloan et al. - 1990
29 Group-Theoretic Algorithms and Graph Isomorphism (context) - Hoffmann - 1982
28 Exact Learning Boolean Functions via the Monotone Theory - Bshouty - 1995
25 On Learning Boolean Functions (context) - Natarajan - 1987
25 Tractable Constraints on Ordered Domains - Jeavons, Cooper - 1996
24 The Two-Valued Iterative Systems of Mathematical Logic (context) - Post - 1941
23 Characterizing Tractable Constraints (context) - Cooper, Cohen et al. - 1994
15 Harper and Row (context) - Cohn - 1965
14 Consistency and Closure (context) - Jeavons, Cohen et al. - 1998
11 Wadsworth and Brooks (context) - McKenzie, McNulty et al. - 1987
9 Polynomial Interpolation and the Chinese Remainder Theorem f.. (context) - Baker, Pixley - 1975
5 Cambridge University Press (context) - Pippenger, Computability - 1997
3 A Dichotomy Theorem for Learning Quantified Boolean Formulas - Dalmau - 1999
3 On Learnability and Predicate Logic (context) - Maass, Tur'an - 1995
3 volume 99 of Seminaires de Math'ematiques Sup'ereiores (context) - Szendrei, Universal - 1986
3 Idempotent algebras with restrictions in subalgebras (context) - Szendrei - 1987
2 Learning counting functions with queries (context) - Chen, Homer - 1997
2 valued closed classes without a finite basis (context) - Yanov, Muchnik et al. - 1959
Documents on the same site (http://www-lsi.upc.es/~dalmau/Papers.html): More
A Dichotomy Theorem for Learning Quantified Boolean Formulas - Dalmau (1997) (Correct)
A New Tractable Class Of Constraint Satisfaction Problems - Dalmau (2000) (Correct)
Some Dichotomy Theorems on Constant-free Quantified Boolean.. - Dalmau (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC