The following pages link to Phokion G. Kolaitis (Q269316):
Displaying 50 items.
- On the data complexity of consistent query answering (Q269317) (← links)
- Data exchange: semantics and query answering (Q555772) (← links)
- Finite model theory and its applications. (Q703863) (← links)
- A dichotomy in the complexity of consistent query answering for queries with two atoms (Q763497) (← links)
- The expressive power of stratified logic programs (Q803773) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- (Q955339) (redirect page) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- On the expressive power of Datalog: tools and a case study. (Q960526) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Logical definability of NP optimization problems (Q1342522) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- On the computational complexity of non-dictatorial aggregation (Q1617839) (← links)
- Limits of schema mappings (Q1650918) (← links)
- Expressive power of entity-linking frameworks (Q1740667) (← links)
- A dichotomy in the complexity of propositional circumscription (Q1764422) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Approximation properties of NP minimization classes (Q1894448) (← links)
- The complexity of counting problems in equational matching (Q1914166) (← links)
- Universal solutions for temporal data exchange (Q2051817) (← links)
- A SAT-based system for consistent query answering (Q2181925) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
- (Q2741517) (← links)
- (Q2762521) (← links)
- Learning schema mappings (Q2943558) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- Expressive Power of Entity-Linking Frameworks (Q3174899) (← links)
- Some computational aspects of circumscription (Q3474909) (← links)
- On preservation under homomorphisms and unions of conjunctive queries (Q3546314) (← links)
- Data exchange: getting to the core (Q3549128) (← links)
- (Q3690805) (← links)
- Asymptotic enumeration and a 0-1 law for $m$-clique free graphs (Q3708834) (← links)
- (Q3747761) (← links)
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law (Q3781776) (← links)
- Recursion in a quantifier vs. elementary induction (Q3861374) (← links)
- (Q3921208) (← links)
- (Q3964558) (← links)
- (Q4010359) (← links)
- (Q4190624) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
- (Q4395613) (← links)
- (Q4414536) (← links)
