UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 173

Sortiert nach

SPASS-AR: A First-Order Theorem Prover Based on Approximation-Refinement into the Monadic Shallow Linear Fragment

Journal of automated reasoning, 2020-03, Vol.64 (3), p.611-640

2020

Volltextzugriff (PDF)

Preface to the Special Issue on Automated Reasoning Systems

Journal of automated reasoning, 2020-03, Vol.64 (3), p.361-362

2020

Volltextzugriff (PDF)

SCL(EQ): SCL for First-Order Logic with Equality

Journal of automated reasoning, 2023-09, Vol.67 (3), p.22, Article 22

2023

Volltextzugriff (PDF)

A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column

Journal of automated reasoning, 2022-11, Vol.66 (4), p.575-584

2022

Volltextzugriff (PDF)

Automated Reasoning Building Blocks

Correct System Design, 2015, p.172-188

2015

Volltextzugriff (PDF)

New techniques for linear arithmetic: cubes and equalities

Formal methods in system design, 2017-12, Vol.51 (3), p.433-461

2017

Volltextzugriff (PDF)

SCL Clause Learning from Simple Models

Automated Deduction – CADE 27, 2019, p.233-249

2019

Volltextzugriff (PDF)

Functional Logic Programming: From Theory to Curry

Programming Logics, p.123-168

Volltextzugriff (PDF)

A complete and terminating approach to linear integer solving

Journal of symbolic computation, 2020-09, Vol.100, p.102-136

2020

Volltextzugriff (PDF)

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Journal of automated reasoning, 2018, Vol.61 (1-4), p.333-365

2018

Volltextzugriff (PDF)

Deciding the Bernays-Schoenfinkel Fragment over Bounded Difference Constraints by Simple Clause Learning over Theories

Verification, Model Checking, and Abstract Interpretation, p.511-533

Volltextzugriff (PDF)

BDI: a new decidable clause class

Journal of logic and computation, 2017-03, Vol.27 (2), p.441-468

2017

Volltextzugriff (PDF)

Programming Logics: Essays in Memory of Harald Ganzinger

2013, 2013

Volltextzugriff (PDF)

StarExec: A Cross-Community Infrastructure for Logic Solving

Automated Reasoning, p.367-373

Volltextzugriff (PDF)

A machine-checked correctness proof for Pastry

Science of computer programming, 2018-06, Vol.158, p.64-80

2018

Volltextzugriff (PDF)

Fast Cube Tests for LIA Constraint Solving

Automated Reasoning, p.116-132

Volltextzugriff (PDF)

Superposition as a Decision Procedure for Timed Automata

Mathematics in computer science, 2012-12, Vol.6 (4), p.409-425

2012

Volltextzugriff (PDF)

Preface: Special Issue of Selected Extended Papers of IJCAR 2014

Journal of automated reasoning, 2017, Vol.58 (1), p.1-2

2017

Volltextzugriff (PDF)

Preface

Journal of automated reasoning, 2017-01, Vol.58 (1), p.1-2

2017

Volltextzugriff (PDF)

On the Expressivity and Applicability of Model Representation Formalisms

Frontiers of Combining Systems, p.22-39

Volltextzugriff (PDF)

Superposition Decides the First-Order Logic Fragment Over Ground Theories

Mathematics in computer science, 2012-12, Vol.6 (4), p.427-456

2012

Volltextzugriff (PDF)

Linear Integer Arithmetic Revisited

Automated Deduction - CADE-25, p.623-637

Volltextzugriff (PDF)

Superposition for Bounded Domains

Automated Reasoning and Mathematics, p.68-100

Volltextzugriff (PDF)

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Automated Reasoning, p.25-44

Volltextzugriff (PDF)

A Gentle Non-disjoint Combination of Satisfiability Procedures

Automated Reasoning, 2014, p.122-136

2014

Volltextzugriff (PDF)

1 – 25 von 173

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(125)
Mit Volltextzugriff
(170)

Publikationsform

1 weiteren anzeigen...

Weniger anzeigen...

Sprache

Englisch
(173)
Japanisch
(2)

Erscheinungsjahr

n.n

Menü

Weitere Dienste

Einstellungen

SPASS-AR: A First-Order Theorem Prover Based on Approximation-Refinement into the Monadic Shallow Linear Fragment

Preface to the Special Issue on Automated Reasoning Systems

SCL(EQ): SCL for First-Order Logic with Equality

A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column

Automated Reasoning Building Blocks

New techniques for linear arithmetic: cubes and equalities

SCL Clause Learning from Simple Models

Functional Logic Programming: From Theory to Curry

A complete and terminating approach to linear integer solving

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

Deciding the Bernays-Schoenfinkel Fragment over Bounded Difference Constraints by Simple Clause Learning over Theories

BDI: a new decidable clause class

Programming Logics: Essays in Memory of Harald Ganzinger

StarExec: A Cross-Community Infrastructure for Logic Solving

A machine-checked correctness proof for Pastry

Fast Cube Tests for LIA Constraint Solving

Superposition as a Decision Procedure for Timed Automata

Preface: Special Issue of Selected Extended Papers of IJCAR 2014

Preface

On the Expressivity and Applicability of Model Representation Formalisms

Superposition Decides the First-Order Logic Fragment Over Ground Theories

Linear Integer Arithmetic Revisited

Superposition for Bounded Domains

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

A Gentle Non-disjoint Combination of Satisfiability Procedures

Suchergebnisse filtern