PrologInfo 2024-06

pdf 27 pages

… the LLM Actor generates declarative logic programs along with tests for semantic correctness, while the Automated Reasoning Critic evaluates the code, runs the tests and provides feedback on test failures for iterative refinement. Implemented using Answer Set Programming [clingo]

pdf 36 pages

Via an intermediate step of a diagrammatic approach to logical expressions called Peirce graphs, we introduce RDF Surfaces, an extension of RDF that incorporates the concept of classic negation

pdf 38 pages

… we use λProlog to specify and prototype all aspects of our PBT project.

λProlog’s support of λ-tree syntax, which is not supported by Prolog, allows us to be competitive with specialized tools, such as αCheck.

When implemented in λProlog, our proof checker can also treat the search for counterexamples that contain bindings, a feature important when data such as programs are the possible counterexamples under study.

pdf 11 pages

… we first define the answer set semantics of (boolean) neural nets and then introduce from first principles a class of neural logic programs and show that nets and programs are equivalent.

pdf 22 pages

… we develop a method for extracting immediately human interpretable classifiers from tabular data. The classifiers are given in the form of short Boolean formulas built with propositions that can either be directly extracted from categorical attributes or dynamically computed from numeric ones. Our method is implemented using Answer Set Programming [specifically, "ASP modulo difference logic, implemented by the Clingo-dl system"].

pdf 9 pages

We propose Traffic Scenario Logic (TSL), which is a spatial-temporal logic designed for modeling and reasoning of urban pedestrian-free traffic scenarios. … We implemented the reasoning of TSL using Telingo, i.e., a solver for temporal programs based on the Answer Set Programming

pdf 11 pages

We present an implementation of Large Neighborhood Prioritized Search (LNPS) based on Answer Set Programming (ASP). The resulting heulingo solver demonstrates that LNPS can significantly enhance the solving performance of ASP for optimization.

pdf 12 pages

Datalog° is a simple abstraction, which allows aggregates to be interleaved with recursion, and retains much of the simplicity and elegance of Datalog.