Back to Results
First PageMeta Content
Logic in computer science / Boolean algebra / Propositional calculus / Operations research / Combinatorial optimization / Maximum satisfiability problem / Interpretation / Mathematical optimization / Solver / Mathematics / Theoretical computer science / Mathematical logic


Using SAT-Solvers to Compute Inference-Proof Database Instances (Abstract Version) Cornelia Tadros and Lena Wiese Technische Universitat Dortmund, 44221 Dortmund, Germany {tadros,wiese}@ls6.cs.uni-dortmund.de
Add to Reading List

Document Date: 2009-06-22 13:18:06

Open Document

File Size: 79,52 KB

Share Result on Facebook

/

IndustryTerm

database systems / /

Person

Joachim Biskup / Lena Wiese / Javier Larrosa / Federico Heras / Thomas Schiex / Min Li / Cornelia Tadros / Jordi Planes / Lena Wiese Technische Universit / /

Technology

cient W-PMSAT technology / /

URL

http /

SocialTag