Back to Results
First PageMeta Content
Order theory / Philosophical logic / Predicate logic / Deduction / Formal methods / Entailment / Abstract interpretation / First-order logic / Galois connection / Mathematics / Logic / Mathematical logic


Abstract Satisfaction Vijay D’Silva Leopold Haller Daniel Kroening
Add to Reading List

Document Date: 2014-05-29 09:55:04

Open Document

File Size: 399,75 KB

Share Result on Facebook

City

San Diego / /

Company

Abstract Interpretation We / Structural Rules We / Ford / /

Country

United States / /

/

Facility

Computer Science University / Computer Science University of California / Computer Science University of Oxford leopold.haller@cs.ox.ac.uk Department / /

IndustryTerm

in-processing techniques / closure operator / fixed point approximation algorithms / brute force algorithms / satisfiability algorithms / pre-/in-processing combine / e-to / computing / proof systems / congruence closure algorithm / search space / /

Organization

University of California / Berkeley / Computer Science University of Oxford / ded / Abstract Satisfaction Vijay D’Silva Leopold Haller Daniel Kroening Department / Computer Science University of Oxford leopold.haller@cs.ox.ac.uk Department / /

Person

Silva Leopold Haller Daniel Kroening / /

Position

author / /

ProgrammingLanguage

D / /

Technology

Abstract Conflict Driven Learning algorithm / satisfiability algorithms / av / fixed point approximation algorithms / congruence closure algorithm / Putnam algorithm / classic DPLL algorithm / reasoning algorithm / brute force algorithms / /

URL

http /

SocialTag