The following pages link to Georg Gottlob (Q202112):
Displaying 50 items.
- Tractability frontiers of the partner units configuration problem (Q269477) (← links)
- On minimal constraint networks (Q359976) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- (Q657903) (redirect page) (← links)
- Distributed XML design (Q657904) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- The complexity of nested counterfactuals and iterated knowledge base revisions (Q676453) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques (Q805270) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Taxonomy and formal properties of distributed joins (Q1072721) (← links)
- Subsumption and implication (Q1094152) (← links)
- On the size of nonredundant FD-covers (Q1108065) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- Selective inheritance of attribute values in relational databases (Q1202889) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Cumulative default logic: Finite characterization, algorithms, and complexity (Q1337685) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Enhancing model checking in verification by AI techniques (Q1606310) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Tractable reasoning in description logics with functionality constraints (Q1799301) (← links)
- Datalog: A self-contained tutorial. II (Q1817097) (← links)
- Magic semi-joins (Q1824417) (← links)
- Propositional default logics made easier: computational complexity of model checking. (Q1853549) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- The complexity of default reasoning under the stationary fixed point semantics (Q1898114) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Formalizing the repair process --- extended report (Q1924800) (← links)
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning (Q1928818) (← links)
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- The HyperTrac project: recent progress and future research directions on hypergraph decompositions (Q2110383) (← links)
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies (Q2248518) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Vadalog: recent advances and applications (Q2296692) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- (Q2702742) (← links)
- (Q2734948) (← links)
- (Q2767002) (← links)
