1.5k citations
- Massachusetts Institute of TechnologyUS174 papers
- Purdue University West LafayetteUS166 papers
- Wayne State UniversityUS164 papers
- The Ohio State UniversityUS162 papers
- University of California, DavisUS162 papers
- University of California, Los AngelesUS162 papers
- Texas A&M UniversityUS160 papers
- University of RochesterUS151 papers
- Joint Institute for Nuclear ResearchRU150 papers
- University of FloridaUS147 papers
- University of HelsinkiFI144 papers
- Fermi National Accelerator LaboratoryUS143 papers
5 papers · 2 filters
An Improved Proof-Theoretic Compilation of Logic Programs
Iliano Cervesato
In prior work, we showed that logic programming compilation can be given a proof-theoretic justification for generic abstract logic programming languages, and demonstrated this tec…
Learning Probabilistic Systems from Tree Samples
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with r…
Assume-Guarantee Abstraction Refinement for Probabilistic Systems
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
We describe an automated technique for assume-guarantee style checking of strong simulation between a system and a specification, both expressed as non-deterministic Labeled Probab…
Constructive Provability Logic
Robert J. Simmons, Bernardo Toninho
We present constructive provability logic, an intuitionstic modal logic that validates the Löb rule of Gödel and Löb's provability logic by permitting logical reflection over prova…
First-Order Mixed Integer Linear Programming
Geoffrey Gordon, Sue Ann Hong, Miroslav Dudik
Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to re…