Back to Results
First PageMeta Content
Finite model theory / Descriptive complexity / Computational complexity theory / FO / Constraint programming / Constraint satisfaction problem / Conjunctive query / SO / HO / Theoretical computer science / Applied mathematics / Complexity classes


On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz1 and Frank Wolter2 1 2
Add to Reading List

Document Date: 2015-06-14 08:17:32

Open Document

File Size: 782,69 KB

Share Result on Facebook

Company

Creative Commons / 3SAT / Dagstuhl Publishing / /

Country

Germany / /

Currency

pence / /

/

Event

Force Majeure / /

Facility

University of Liverpool / /

IndustryTerm

type systems / database systems / /

Organization

Universität Bremen / University of Liverpool / Department of Computer Science / /

Person

Marcelo Arenas / Fontaine / Martin Ugarte / /

Position

head of at least one rule / types professor / professor / /

ProgrammingLanguage

Datalog / /

ProvinceOrState

Vardi / Feder / Iowa / Pennsylvania / /

Technology

RDBMS / Digital Object Identifier / /

URL

http /

SocialTag