Jacob M. Howe

Sandamali Yashodhara Wickramasinghe

Laure Daviaud

Proceedings of the Short Paper Proceedings of the 7th International Workshop on Artificial Intelligence and Formal Verification, 2025

Extracting Deterministic Finite Automata from RNNs via Hyperplane Partitioning and Learning.

[BibT_eX]

[DOI]

Laure Daviaud

Proceedings of the Computational Intelligence - 17th International Joint Conference, 2025

Rule Extraction from Fake News Classifiers.

[BibT_eX]

[DOI]

Fatima Iqbal

Proceedings of the Computational Intelligence - 17th International Joint Conference, 2025

2023

Widening for Systems of Two Variables Per Inequality.

[BibT_eX]

[DOI]

Martin Brain

Proceedings of the 8th SC-Square Workshop co-located with the 48th International Symposium on Symbolic and Algebraic Computation, 2023

2021

Backjumping is Exception Handling.

[BibT_eX]

[DOI]

Ed Robbins

Theory Pract. Log. Program., 2021

Classification of Date Fruits in a Controlled Environment Using Convolutional Neural Networks.

[BibT_eX]

[DOI]

Wadha S. N. Alhamdan

Proceedings of the Advanced Machine Learning Technologies and Applications, 2021

2019

Incremental Closure for Systems of Two Variables Per Inequality.

[BibT_eX]

[DOI]

Axel Simon

Theor. Comput. Sci., 2019

Efficient Predicate Invention using Shared NeMuS.

[BibT_eX]

Edjard Mota

Ana Schramm

Proceedings of the 2019 International Workshop on Neural-Symbolic Learning and Reasoning (NeSy 2019), 2019

Exact and Approximate Rule Extraction from Neural Networks with Boolean Features.

[BibT_eX]

[DOI]

Fawaz A. Mereani

Proceedings of the 11th International Joint Conference on Computational Intelligence, 2019

2018

Preventing Cross-Site Scripting Attacks by Combining Classifiers.

[BibT_eX]

[DOI]

Fawaz A. Mereani

Proceedings of the 10th International Joint Conference on Computational Intelligence, 2018

Detecting Cross-Site Scripting Attacks Using Machine Learning.

[BibT_eX]

[DOI]

Fawaz A. Mereani

Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications, 2018

2017

Theory learning with symmetry breaking.

[BibT_eX]

[DOI]

Edward Robbins

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

Learning about Actions and Events in Shared NeMuS.

[BibT_eX]

[DOI]

Milena Rodrigues Tenorio

Edjard de Souza Mota

Ana Carolina Melik Schramm

Proceedings of the Twelfth International Workshop on Neural-Symbolic Learning and Reasoning, 2017

Category-based Inductive Learning in Shared NeMuS.

[BibT_eX]

[DOI]

Edjard de Souza Mota

Proceedings of the Twelfth International Workshop on Neural-Symbolic Learning and Reasoning, 2017

Inductive Learning in Shared Neural Multi-Spaces.

[BibT_eX]

[DOI]

Edjard de Souza Mota

Proceedings of the Twelfth International Workshop on Neural-Symbolic Learning and Reasoning, 2017

2015

Theory propagation and reification.

[BibT_eX]

[DOI]

Edward Robbins

Sci. Comput. Program., 2015

2013

Theory propagation and rational-trees.

[BibT_eX]

[DOI]

Edward Robbins

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

2012

A pearl on SAT and SMT solving in Prolog.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Polyhedral Analysis Using Parametric Objectives.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 19th International Symposium, 2012

2010

Quadtrees as an Abstract Domain.

[BibT_eX]

[DOI]

Charles Lawrence-Jones

Proceedings of the Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, 2010

A Pearl on SAT Solving in Prolog.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009

Logahedra: A New Weakly Relational Domain.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2009

Integer Polyhedra for Program Analysis.

[BibT_eX]

[DOI]

Philip J. Charles

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2004

Analysing Logic Programs by Reasoning Backwards.

[BibT_eX]

[DOI]

Lunjin Lu

Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

2003

Three Optimisations for Sharing.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2003

Efficient Groundness Analysis in Prolog.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2003

2002

Two Variables per Linear Inequality as an Abstract Domain.

[BibT_eX]

[DOI]

Axel Simon

Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

2001

Worst-case groundness analysis using definite boolean functions.

[BibT_eX]

[DOI]

Samir Genaim

Michael Codish

Theory Pract. Log. Program., 2001

Proof search in Lax Logic.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2001

Positive Boolean Functions as Multiheaded Clauses.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 17th International Conference, 2001

2000

Abstracting numeric constraints with Boolean functions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Implementing Groundness Analysis with Definite Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2000

1999

Specialising Fininte Domain Programs Using Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1999

Specialising Finite Domain Programs Using Polyhedra.

[BibT_eX]

Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1998

Proof search issues in some non-classical logics.

[BibT_eX]

[DOI]

PhD thesis, 1998

1997

Two Loop Detection Mechanisms: A Comparision.

[BibT_eX]

[DOI]