EasyChair Smart SlideDocs/Log in
Conference: LPAR23 (LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning)

This page shows all presentations from this conference published in EasyChair Smart Slide.

Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols

Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols

Mooly Sagiv

Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic

Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic

Thibault Gauthier

Parameter Synthesis for Probabilistic Hyperproperties

Parameter Synthesis for Probabilistic Hyperproperties

Erika Abraham, Ezio Bartocci, Borzoo Bonakdarpour and Oyendrila Dobe

Induction Models on N

Induction Models on N

A Dileep, Kuldeep S. Meel and Ammar F. Sabili

Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation

Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation

Jarkko Savela, Emilia Oikarinen and Matti Järvisalo

Polynomial Loops: Beyond Termination

Polynomial Loops: Beyond Termination

Marcel Hark, Florian Frohn and Jürgen Giesl

Coloring Unit-Distance Strips using SAT

Coloring Unit-Distance Strips using SAT

Peter Oostema, Ruben Martins and Marijn Heule

Sensitivity Analysis of Locked Circuits

Sensitivity Analysis of Locked Circuits

Joseph Sweeney, Marijn J. H. Heule and Lawrence Pileggi

Decision Levels Are Stable: Towards Better SAT Heuristics

Decision Levels Are Stable: Towards Better SAT Heuristics

Robert Nieuwenhuis, Adrià Lozano, Albert Oliveras and Enric Rodríguez-Carbonell

An ASP-Based Approach for Boolean Networks Representation and Attractor Detection

An ASP-Based Approach for Boolean Networks Representation and Attractor Detection

Tarek Khaled and Belaid Benhamou

Minimal Modifications of Deep Neural Networks Using Verification

Minimal Modifications of Deep Neural Networks Using Verification

Ben Goldberger, Guy Katz, Yossi Adi and Joseph Keshet

Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard

Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard

Mnacho Echenim, Radu Iosif and Nicolas Peltier

Presentations in this collection: 12
Copyright © 2002 – 2024 EasyChair