A Formal Comparison of Visual Web Wrapper Generators

A backtracking-based algorithm for hypertree decomposition

A comparison of structural CSP decomposition methods

scientific article (publication date: December 2000)

A front row seat to Communications' editorial transformation

2014 scholarly article

A general Datalog-based framework for tractable query answering over ontologies

A general datalog-based framework for tractable query answering over ontologies

A logical approach to multicut problems

article

A logical toolbox for ontological reasoning

article

Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic

scientific article published in January 2018

Achieving new upper bounds for the hypergraph duality problem through logic

scientific article published in 2014

Alternation as a programming paradigm

An efficient method for eliminating varying predicates from a circumscription

article published in 1992

Answering Threshold Queries in Probabilistic Datalog+/– Ontologies

article published in 2011

Balanced Queries: Divide and Conquer

article published in 2010

Bounded treewidth as a key to tractability of knowledge representation and reasoning

Capturing Relativized Complexity Classes without Order

Chapter 6: Web Data Extraction for Service Creation

article

Chapter 9: Service Marts

Chase Termination for Guarded Existential Rules

Combining Semantic Web Search with the Power of Inductive Reasoning

Combining decidability paradigms for existential rules

Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming - CORRIGENDUM

scholarly article published in Theory and Practice of Logic Programming

Complexity Results for Nonmonotonic Logics

Complexity and expressive power of logic programming

Complexity of propositional nested circumscription and nested abnormality theories

Computational aspects of monotone dualization: A brief survey

Computing LOGCFL certificates

Computing cores for data exchange

Conjunctive Query Answering in Probabilistic Datalog+/– Ontologies

Conjunctive queries over trees

Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/-

article published in 2015

Cumulative default logic: Finite characterization, algorithms, and complexity

DIADEM

2012 proceeding of the 21st International Conference on World Wide Web

DIADEM: Domains to Databases

Data Integration: a Challenging ASP Application

scientific article published in 2005

Data exchange

Datalog Extensions for Tractable Query Answering over Ontologies

Datalog and Its Extensions for Semantic Web Databases

article published in 2012

Datalog+/-: A Family of Languages for Ontology Querying

article published in 2011

Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

article

Datalog±

Deciding monotone duality and identifying frequent itemsets in quadratic logspace

article

Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto

article

Default logic as a query language

Determining relevance of accesses at runtime

Distributed XML design

Distributed XML design

Efficient algorithms for processing XPath queries

scholarly article by Georg Gottlob et al published 1 June 2005 in ACM Transactions on Database Systems

Efficient core computation in data exchange

Efficient database access from Prolog

Enhancing model checking in verification by AI techniques

Existential second-order logic over graphs

Existential second-order logic over graphs: charting the tractability frontier

Exploring the web with OXPath

Expressive languages for querying the semantic web

Expressiveness of guarded existential rule languages

Expressiveness of stable model semantics for disjunctive logic programs with functions

Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

scientific article published on 23 November 2007

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

Fixed-parameter complexity in AI and nonmonotonic reasoning

Formalizing the repair process ? extended report

Function Symbols in Tuple-Generating Dependencies

Generalized Quantifiers in Logic Programs

Generalized hypertree decompositions

Generalized hypertree decompositions: NP-hardness and tractable variants

Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques

Guest Editor's Foreword

How the Minotaur Turned into Ariadne: Ontologies in Web Data Extraction

HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results

scholarly article by Georg Gottlob et al published 2009 in Lecture Notes in Computer Science

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

article

Hypertree Decompositions

Hypertree Decompositions and Tractable Queries

Hypertree Decompositions: Structure, Algorithms, and Applications

scholarly article by Georg Gottlob et al published 2005 in Lecture Notes in Computer Science

Hypertree width and related hypergraph invariants

Inductive reasoning and semantic web search

InfoPipes: A Flexible Framework for M-Commerce Applications

Interactively adding Web service interfaces to existing Web applications

Little Knowledge Rules the Web: Domain-Centric Result Page Extraction

article by Tim Furche et al published 2011 in Lecture Notes in Computer Science

LoCo—A Logic for Configuration Problems

Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data

Magic semi-joins

Monadic datalog and the expressive power of languages for Web information extraction

Monadic datalog over finite structures of bounded treewidth

Monadic datalog over finite structures with bounded treewidth

Monadic queries over tree-structured data

NP trees and Carnap's modal logic

New Results on Monotone Dualization and Generating Hypergraph Transversals

Normalization and optimization of schema mappings

Normalization of relations and PROLOG

OPAL: automated form understanding for the deep web

research article

OXPath

OXPath: A language for scalable data extraction, automation, and crawling on the deep web

On ACTL Formulas Having Linear Counterexamples

article

On Minimal Constraint Networks

On minimal constraint networks

On the Complexity of Ontological Reasoning under Disjunctive Existential Rules

article published in 2012

On the Interaction of Existential Rules and Equality Constraints in Ontology Querying

On the complexity of combinatorial auctions

On the complexity of deriving schema mappings from database instances

scholarly article published 2008

On the complexity of propositional knowledge base revision, updates, and counterfactuals

On the complexity of some Inductive Logic Programming problems

On the computational cost of disjunctive logic programming: Propositional case

On the efficiency of subsumption algorithms

scholarly article by Georg Gottlob & A. Leitsch published 1 April 1985 in Journal of the ACM

On the size of nonredundant FD-covers

Ontological Query Answering via Rewriting

article published in 2011

Ontological queries: Rewriting and optimization

Ontological query answering under expressive Entity–Relationship schemata

Ontology-based semantic search on the Web and its combination with the power of inductive reasoning

Optimization Methods for the Partner Units Problem

Preface of the Special Issue in Memoriam Helmut Veith

scientific article published in November 2017

Properties and update semantics of consistent views

Propositional circumscription and extended closed-world reasoning are ΠP2-complete

Propositional default logics made easier: computational complexity of model checking

article

Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$

Query Answering under Expressive Entity-Relationship Schemata

Query Answering under Non-guarded Rules in Datalog+/-

article published in 2010

Query Rewriting and Optimization for Ontological Databases

Query answering under probabilistic uncertainty in Datalog+ / − ontologies

Querying Conceptual Schemata with Expressive Equality Constraints

Querying UML Class Diagrams

Querying the Guarded Fragment

Querying the Guarded Fragment

Querying the Guarded Fragment with Transitivity

RDF Querying: Language Constructs and Evaluation Methods Compared

Real understanding of real estate forms

Reasoning under minimal upper bounds in propositional logic

Recent Advances in Datalog $$^\pm $$

Removing redundancy from a clause

scientific article published in June 1993

Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

article

Schema mapping discovery from data instances

article by Georg Gottlob & Pierre Senellart published 1 January 2010 in Journal of the ACM

Second-Order Logic over Finite Structures – Report on a Research Programme

Selective inheritance of attribute values in relational databases

Semantic Acyclicity Under Constraints

Semantic Web Search Based on Ontological Conjunctive Queries

Semantic Web search based on ontological conjunctive queries

Size and Treewidth Bounds for Conjunctive Queries

Size and treewidth bounds for conjunctive queries

Subsumption and implication

Taking the OXPath down the deep web

The Complexity of Default Reasoning Under the Stationary Fixed Point Semantics

article by Georg Gottlob published August 1995 in Information and Computation

The DLV system for knowledge representation and reasoning

The INFOMIX system for advanced integration of incomplete and inconsistent data

The Impact of Active Domain Predicates on Guarded Existential Rules

The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey

article

The Personal Publication Reader

The VADA Architecture for Cost-Effective Data Wrangling

scholarly article published 2017

The complexity class θp2: Recent results and applications in AI and modal logic

The complexity of XPath query evaluation and XML typing

The complexity of acyclic conjunctive queries

The complexity of logic-based abduction

The ontological key: automatically understanding and integrating forms to access the deep Web

The price of query rewriting in ontology-based data access

Towards more expressive ontology languages: The query answering problem

article published in 2012

Towards more expressive ontology languages: The query answering problem

academic article published in 2012

Tractability frontiers of the partner units configuration problem

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

Tractable Query Answering over Conceptual Schemata

article published in 2009

Tractable database design and datalog abduction through bounded treewidth

Tractable database design through bounded treewidth

Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries

scholarly article by S. Ceri & Georg Gottlob published April 1985 in IEEE Transactions on Software Engineering

Translating default logic into standard autoepistemic logic

scientific article (publication date: July 1995)

Tree Projections: Game Characterization and Computational Aspects

Treewidth and Hypertree Width

Uniform Constraint Satisfaction Problems and Database Theory

Web information acquisition with Lixto Suite: a demonstration

Well-founded semantics for extended datalog and ontological reasoning

When Automatic Filtering Comes to the Rescue: Pre-Computing Company Competitor Pairs in Owler

scientific article published on 20 June 2023

Width Parameters Beyond Tree-width and their Applications

Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models

Wormholes of Communication: Interfacing Virtual Worlds and the Real World

scholarly article published 2009

XPath processing in a nutshell

March 2003 scholarly article in ACM SIGMOD Record

XPath processing in a nutshell

June 2003 scholarly article in ACM SIGMOD Record

XPath query evaluation: improving time and space efficiency

ICDE.2003 scholarly article