György Turán

Inf. Comput., 2022

Interpreting Deep-Learned Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Evaluating interpretations of deep-learned error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021

Preface.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2021

2020

Explanation from Specification.

[BibT_eX]

[DOI]

Harish Naik

CoRR, 2020

Approximating bounded tree-width Bayesian network classifiers with OBDD.

[BibT_eX]

[DOI]

Karine Chubarian

Proceedings of the International Conference on Probabilistic Graphical Models, 2020

Interpretability of Bayesian Network Classifiers: OBDD Approximation and Polynomial Threshold Functions.

[BibT_eX]

[DOI]

Karine Chubarian

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base.

[BibT_eX]

[DOI]

Vanda Balogh

Gábor Berend

Dimitrios I. Diochnos

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2017

Hydras: Directed hypergraphs and Horn formulas.

[BibT_eX]

[DOI]

Despina Stasi

Theor. Comput. Sci., 2017

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Measuring an artificial intelligence system's performance on a Verbal IQ test for young children.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2017

Betweenness centrality profiles in trees.

[BibT_eX]

[DOI]

Benjamin Fish

Rahul Kushwaha

J. Complex Networks, 2017

Foreword.

[BibT_eX]

[DOI]

Lisa Hellerstein

Lev Reyzin

Ann. Math. Artif. Intell., 2017

2016

Characterizability in Horn Belief Revision.

[BibT_eX]

[DOI]

Jon Yaggie

Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

2015

On the Computational Complexity of MapReduce.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Cognitive Programming.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Artificial Intelligence and Cognition, 2015

Characterizability in Belief Revision.

[BibT_eX]

[DOI]

Jon Yaggie

Proceedings of the 2015 AAAI Spring Symposia, 2015

2014

Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Non-characterizability of belief revision: an application of finite model theory.

[BibT_eX]

[DOI]

Jon Yaggie

CoRR, 2014

Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.

[BibT_eX]

[DOI]

CoRR, 2014

Among-site rate variation: adaptation of genetic algorithm mutation rates at each single site.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Balancing the exploration and exploitation in an adaptive diversity guided genetic algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013

Verbal IQ of a Four-Year Old Achieved by an AI System.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

On multiple-instance learning of halfspaces.

[BibT_eX]

[DOI]

Dimitrios I. Diochnos

Inf. Process. Lett., 2012

Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.

[BibT_eX]

[DOI]

Despina Stasi

Discret. Math. Theor. Comput. Sci., 2012

Hydra formulas and directed hypergraphs: A preliminary report.

[BibT_eX]

[DOI]

Despina Stasi

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

An Approach to Evaluate AI Commonsense Reasoning Systems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference, 2012

2011

Horn Belief Contraction: Remainders, Envelopes and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Logical Formalizations of Commonsense Reasoning, 2011

2010

Guest editors' foreword.

[BibT_eX]

[DOI]

László Györfi

Thomas Zeugmann

Theor. Comput. Sci., 2010

Horn Upper Bounds and Renaming.

[BibT_eX]

[DOI]

Marina Langlois

J. Satisf. Boolean Model. Comput., 2010

Finding bipartite subgraphs efficiently.

[BibT_eX]

[DOI]

Dhruv Mubayi

Inf. Process. Lett., 2010

On Approximate Horn Formula Minimization.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Optimizing genetic operator rates using a markov chain model of genetic algorithms.

[BibT_eX]

[DOI]

Fatemeh Vafaee

Peter C. Nelson

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Learning Boolean Functions with Queries.

[BibT_eX]

[DOI]

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009

On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance.

[BibT_eX]

[DOI]

Dimitrios I. Diochnos

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Combinatorial Problems for Horn Clauses.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

2008

On k-Term DNF with the Largest Number of Prime Implicants.

[BibT_eX]

[DOI]

Balázs Szörényi

SIAM J. Discret. Math., 2008

Projective DNF formulae and their revision.

[BibT_eX]

[DOI]

Balázs Szörényi

Discret. Appl. Math., 2008

Horn Complements: Towards Horn-to-Horn Belief Revision.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Revising threshold functions.

[BibT_eX]

[DOI]

Balázs Szörényi

Theor. Comput. Sci., 2007

The inverse protein folding problem on 2D and 3D lattices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Kalmár Workshop on Logic and Computer Science - Preface.

[BibT_eX]

[DOI]

Ferenc Gécseg

Acta Cybern., 2007

2006

The DNF exception problem.

[BibT_eX]

[DOI]

Dhruv Mubayi

Yi Zhao

Theor. Comput. Sci., 2006

On set systems with a threshold property.

[BibT_eX]

[DOI]

Discret. Math., 2006

Horn Upper Bounds of Random 3-CNF: A Computational Study.

[BibT_eX]

[DOI]

Marina Langlois

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

On Learning and Logic.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2004

Learnability and Definability in Trees and Similar Structures.

[BibT_eX]

[DOI]

Martin Grohe

Theory Comput. Syst., 2004

Theory revision with queries: Horn, read-once, and parity formulas.

[BibT_eX]

[DOI]

Artif. Intell., 2004

The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

New Revision Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2002

Theory Revision with Queries: DNF Formulas.

[BibT_eX]

[DOI]

Judy Goldsmith

Mach. Learn., 2002

2001

Learning logic programs with structured background knowledge.

[BibT_eX]

[DOI]

Tamás Horváth

Artif. Intell., 2001

2000

Remarks on computational learning theory.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2000

Improved Algorithms for Theory Revision with Queries.

[BibT_eX]

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

On Theory Revision with Queries.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

On Frequent Sets of Boolean Matrices.

[BibT_eX]

[DOI]

Ken Takata

Ann. Math. Artif. Intell., 1998

Learning Atomic Formulas with Prescribed Properties.

[BibT_eX]

[DOI]

Irene Tsapara

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997

Malicious Omissions and Errors in Answers to Membership Queries.

[BibT_eX]

[DOI]

Mach. Learn., 1997

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In.

[BibT_eX]

[DOI]

Farrokh Vatan

J. Comput. Syst. Sci., 1997

Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, Third European Conference, 1997

Learning Logic Programs by Using the Product Homomorphism Method.

[BibT_eX]

[DOI]

Tamás Horváth

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

A Size-Depth Trade-Off for the Analog Computation of Boolean Functions.

[BibT_eX]

[DOI]

Farrokh Vatan

Inf. Process. Lett., 1996

Learning Logic Programs with Random Classification Noise.

[BibT_eX]

[DOI]

Tamás Horváth

Proceedings of the Inductive Logic Programming, 6th International Workshop, 1996

1995

On the Complexity of Planar Boolean Circuits.

[BibT_eX]

[DOI]

Comput. Complex., 1995

1994

Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts.

[BibT_eX]

[DOI]

Mach. Learn., 1994

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)

[BibT_eX]

[DOI]

Farrokh Vatan

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Learning with Queries but Incomplete Information (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

Threshold Circuits of Bounded Depth.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

A Liniear lower bound for the size of threshold circuits.

[BibT_eX]

Hans Dietmar Gröger

Bull. EATCS, 1993

Two Tapes Versus One for Off-Line Turing Machines.

[BibT_eX]

[DOI]

Comput. Complex., 1993

Lower Bounds for PAC Learning with Queries.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

Lower Bound Methods and Separation Results for On-Line Learning Models.

[BibT_eX]

[DOI]

Mach. Learn., 1992

The Communication Complexity of Interval Orders.

[BibT_eX]

[DOI]

Rainer Schrader

Discret. Appl. Math., 1992

1991

On Linear Decision Trees Computing Boolean Functions.

[BibT_eX]

[DOI]

Hans Dietmar Gröger

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

A Survey of Some Aspects of Computational Learning Theory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

On the Complexity of Learning from Counterexamples and Membership Queries

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

On the Complexity of Learning from Counterexamples and Membership Queries (abstract).

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Lower Bounds for Synchronous Circuits and Planar Circuits.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

On the performance of on-line algorithms for partition problems.

[BibT_eX]

[DOI]

Walter Kern

Acta Cybern., 1989

On the Complexity of Learning From Counterexamples (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On Restricted Boolean Circuits.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Resolution Proofs of Generalized Pigeonhole Principles.

[BibT_eX]

[DOI]

Samuel R. Buss

Theor. Comput. Sci., 1988

Sorting and Recognition Problems for Ordered Sets.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

On the Communication Complexity of Graph Properties

[BibT_eX]

[DOI]

András Hajnal

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

The Complexity of Defining a Relation on a Finite Graph.

[BibT_eX]

[DOI]

László Babai

Math. Log. Q., 1987

A Lower Bound for Read-Once-Only Branching Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

On the complexity of interval orders and semiorders.

[BibT_eX]

[DOI]

Discret. Math., 1987

On the complexity of cutting-plane proofs.

[BibT_eX]

[DOI]

William J. Cook

Collette R. Coullard

Discret. Appl. Math., 1987

1986

Searching in Trees, Series-Parallel and Interval Orders.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Two lower bounds for branching programs

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1984

The Critical Complexity of Graph Properties.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

On the definability of properties of finite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

On the succinct representation of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

1983

On the complexity of graph grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1983

1981

On Cellular Graph-Automata and Second-Order Definable Graph-Properties.

[BibT_eX]

[DOI]