The following pages link to Georg Gottlob (Q202112):
Displaying 50 items.
- Taming the infinite chase: query answering under expressive relational constraints (Q2856474) (← links)
- Querying UML Class Diagrams (Q2892755) (← links)
- On the Interaction of Existential Rules and Equality Constraints in Ontology Querying (Q2900513) (← links)
- On the Complexity of Ontological Reasoning under Disjunctive Existential Rules (Q2912705) (← links)
- Monadic datalog over finite structures of bounded treewidth (Q2946620) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- Optimization Methods for the Partner Units Problem (Q3003271) (← links)
- (Q3113669) (← links)
- (Q3171764) (← links)
- The complexity of acyclic conjunctive queries (Q3196620) (← links)
- (Q3336678) (← links)
- (Q3349969) (← links)
- Second-Order Logic over Finite Structures – Report on a Research Programme (Q3439520) (← links)
- Generalized hypertree decompositions: NP-hardness and tractable variants (Q3452226) (← links)
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ (Q3532465) (← links)
- The complexity of XPath query evaluation and XML typing (Q3546299) (← links)
- Conjunctive queries over trees (Q3546316) (← links)
- Efficient core computation in data exchange (Q3546361) (← links)
- Second order logic and the weak exponential hierarchies (Q3569000) (← links)
- (Q3576650) (← links)
- Schema mapping discovery from data instances (Q3578189) (← links)
- New results on monotone dualization and generating hypergraph transversals (Q3579198) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Balanced Queries: Divide and Conquer (Q3586071) (← links)
- Foundations of Rule-Based Query Answering (Q3603501) (← links)
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (Q3638082) (← links)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- (Q3716319) (← links)
- On the efficiency of subsumption algorithms (Q3771609) (← links)
- Properties and update semantics of consistent views (Q3817025) (← links)
- (Q3929002) (← links)
- Complexity Results for Nonmonotonic Logics (Q4018170) (← links)
- (Q4022222) (← links)
- (Q4250038) (← links)
- (Q4281509) (← links)
- (Q4332416) (← links)
- (Q4332418) (← links)
- Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
- The complexity of logic-based abduction (Q4369855) (← links)
- NP trees and Carnap's modal logic (Q4369870) (← links)
- Translating default logic into standard autoepistemic logic (Q4369881) (← links)
- Expressiveness of stable model semantics for disjunctive logic programs with functions (Q4371993) (← links)
- Capturing Relativized Complexity Classes without Order (Q4379631) (← links)
- (Q4381709) (← links)
- On the indiscernibility of individuals in logic programming (Q4381870) (← links)
- On the expressiveness of frame satisfiability and fragments of second-order logic (Q4391423) (← links)
- Existential second-order logic over strings (Q4406309) (← links)
- (Q4445757) (← links)
