Georg Gottlob

According to our database1, Georg Gottlob
  • authored at least 375 papers between 1983 and 2017.
  • has a "Dijkstra number"2 of four.

Awards

ACM Fellow

ACM Fellow 2007, "For contributions to the theory of artificial intelligence and database systems.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The VADA Architecture for Cost-Effective Data Wrangling.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data.
Proceedings of the Language and Automata Theory and Applications, 2017

Swift Logic for Big Data and Knowledge Graphs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability.
Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

2016
Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming - Corrigendum.
TPLP, 2016

Tractability frontiers of the partner units configuration problem.
J. Comput. Syst. Sci., 2016

General and Fractional Hypertree Decompositions: Hard and Easy Cases.
CoRR, 2016

Semantic Acyclicity Under Constraints.
CoRR, 2016

The Impact of Active Domain Predicates on Guarded Existential Rules.
Proceedings of the Web Reasoning and Rule Systems - 10th International Conference, 2016

Hypertree Decompositions: Questions and Answers.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Semantic Acyclicity Under Constraints.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

The ICDT 2016 Test of Time Award Announcement.
Proceedings of the 19th International Conference on Database Theory, 2016

Data Wrangling for Big Data: Challenges and Opportunities.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

Data Wrangling for Big Data: Towards a Lingua Franca for Data Wrangling.
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016

Semantic Acyclicity Under Constraints.
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016

A Datalog-Based Language for Querying RDF Graphs.
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016

2015
Recent Advances in Datalog ^\pm.
Proceedings of the Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin, Germany, July 31, 2015

Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/-.
Proceedings of the Rule Technologies: Foundations, Tools, and Applications, 2015

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Chase Termination for Guarded Existential Rules.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Polynomial Rewritings for Linear Existential Rules.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations.
Proceedings of the 28th International Workshop on Description Logics, 2015

Chase Termination for Guarded Existential Rules.
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

2014
Query Rewriting and Optimization for Ontological Databases.
ACM Trans. Database Syst., 2014

LoCo - A Logic for Configuration Problems.
ACM Trans. Comput. Log., 2014

DIADEM: Thousands of Websites to a Single Database.
PVLDB, 2014

Query Rewriting and Optimization for Ontological Databases.
CoRR, 2014

Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic.
CoRR, 2014

Querying the Guarded Fragment.
Logical Methods in Computer Science, 2014

A front row seat to Communications' editorial transformation.
Commun. ACM, 2014

The price of query rewriting in ontology-based data access.
Artif. Intell., 2014

Expressiveness of guarded existential rule languages.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Expressive languages for querying the semantic web.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Polynomial Combined Rewritings for Existential Rules.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Datalog+/-: Questions and Answers.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Stable Model Semantics for Guarded Existential Rules and Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Invited Talks.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Achieving new upper bounds for the hypergraph duality problem through logic.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Expressive Languages for Querying the Semantic Web.
Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

Treewidth and Hypertree Width.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

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

The ontological key: automatically understanding and integrating forms to access the deep Web.
VLDB J., 2013

Combining decidability paradigms for existential rules.
TPLP, 2013

Taming the Infinite Chase: Query Answering under Expressive Relational Constraints.
J. Artif. Intell. Res., 2013

Decomposing combinatorial auctions and set packing problems.
J. ACM, 2013

Marco Cadoli's work on nonmonotonic reasoning.
Intelligenza Artificiale, 2013

Query answering under probabilistic uncertainty in Datalog+ / - ontologies.
Ann. Math. Artif. Intell., 2013

Semantic Web Search and Inductive Reasoning.
Proceedings of the Uncertainty Reasoning for the Semantic Web II, 2013

Well-founded semantics for extended datalog and ontological reasoning.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Deciding monotone duality and identifying frequent itemsets in quadratic logspace.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics.
Proceedings of the IJCAI 2013, 2013

Querying the Guarded Fragment with Transitivity.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Well-Founded Semantics for Extended Datalog and Ontological Reasoning.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

Tractable Reasoning in Description Logics with Functionality Constraints.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012
A general Datalog-based framework for tractable query answering over ontologies.
J. Web Sem., 2012

Size and Treewidth Bounds for Conjunctive Queries.
J. ACM, 2012

Ontological query answering under expressive Entity-Relationship schemata.
Inf. Syst., 2012

Taming the Infinite Chase: Query Answering under Expressive Integrity Constraints
CoRR, 2012

Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace
CoRR, 2012

AMBER: Automatic Supervision for Multi-Attribute Extraction
CoRR, 2012

The Ontological Key: Automatically Understanding and Integrating Forms to Access the Deep Web
CoRR, 2012

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
CoRR, 2012

Ontology-based semantic search on the Web and its combination with the power of inductive reasoning.
Ann. Math. Artif. Intell., 2012

On minimal constraint networks.
Artif. Intell., 2012

Towards more expressive ontology languages: The query answering problem.
Artif. Intell., 2012

OPAL: automated form understanding for the deep web.
Proceedings of the 21st World Wide Web Conference 2012, 2012

DIADEM: domain-centric, intelligent, automated data extraction methodology.
Proceedings of the 21st World Wide Web Conference, 2012

Preface.
Proceedings of the Second International Workshop on Searching and Integrating New Web Data Sources, 2012

Datalog and Its Extensions for Semantic Web Databases.
Proceedings of the Reasoning Web. Semantic Technologies for Advanced Query Answering, 2012

On the Complexity of Ontological Reasoning under Disjunctive Existential Rules.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Rewriting Ontological Queries into Small Nonrecursive Datalog Programs.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Querying UML Class Diagrams.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Equality-Friendly Well-Founded Semantics and Applications to Description Logics.
Proceedings of the 2012 International Workshop on Description Logics, 2012

DIADEM: Domains to Databases.
Proceedings of the Database and Expert Systems Applications, 2012

On the Interaction of Existential Rules and Equality Constraints in Ontology Querying.
Proceedings of the Correct Reasoning, 2012

Equality-Friendly Well-Founded Semantics and Applications to Description Logics.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Return of the Entity-Relationship Model: Ontological Query Answering.
Proceedings of the Semantic Search over the Web, 2012

2011
Semantic Web search based on ontological conjunctive queries.
J. Web Sem., 2011

Normalization and optimization of schema mappings.
VLDB J., 2011

A logical toolbox for ontological reasoning.
SIGMOD Record, 2011

OXPath: A Language for Scalable, Memory-efficient Data Extraction from Web Applications.
PVLDB, 2011

Distributed XML design.
J. Comput. Syst. Sci., 2011

Computer Science & Problem Solving: New Foundations (Dagstuhl Seminar 11351).
Dagstuhl Reports, 2011

Ontological Queries: Rewriting and Optimization (Extended Version)
CoRR, 2011

Pure Nash Equilibria: Hard and Easy Games
CoRR, 2011

Introducing LoCo, a Logic for Configuration Problems
Proceedings of the Proceedings Second Workshop on Logics for Component Configuration, 2011

Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
CoRR, 2011

Determining Relevance of Accesses at Runtime (Extended Version)
CoRR, 2011

On Minimal Constraint Networks
CoRR, 2011

OXPath: little language, little memory, great value.
Proceedings of the 20th International Conference on World Wide Web, 2011

Real understanding of real estate forms.
Proceedings of the International Conference on Web Intelligence, Mining and Semantics, 2011

Answering Threshold Queries in Probabilistic Datalog+/- Ontologies.
Proceedings of the Scalable Uncertainty Management - 5th International Conference, 2011

Structural Decomposition Methods and What They are Good For.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies.
Proceedings of the Web Reasoning and Rule Systems - 5th International Conference, 2011

Little Knowledge Rules the Web: Domain-Centric Result Page Extraction.
Proceedings of the Web Reasoning and Rule Systems - 5th International Conference, 2011

Determining relevance of accesses at runtime.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Tackling the Partner Units Configuration Problem.
Proceedings of the IJCAI 2011, 2011

How the Minotaur Turned into Ariadne: Ontologies in Web Data Extraction.
Proceedings of the Web Engineering - 11th International Conference, 2011

Ontological queries: Rewriting and optimization.
Proceedings of the 27th International Conference on Data Engineering, 2011

Querying Conceptual Schemata with Expressive Equality Constraints.
Proceedings of the Conceptual Modeling - ER 2011, 30th International Conference, 2011

Taking the OXPath down the deep web.
Proceedings of the EDBT 2011, 2011

Exploring the web with OXPath.
Proceedings of the 2011 EDBT/ICDT Workshop on Linked Web Data Management, 2011

Rewriting Ontological Queries into Small Nonrecursive Datalog Programs.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

Optimization Methods for the Partner Units Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

On Minimal Constraint Networks.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Ontological Query Answering via Rewriting.
Proceedings of the Advances in Databases and Information Systems, 2011

New Expressive Languages for Ontological Query Answering.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Monadic datalog over finite structures of bounded treewidth.
ACM Trans. Comput. Log., 2010

Advanced Processing for Ontological Queries.
PVLDB, 2010

The Impact of Virtual Views on Containment.
PVLDB, 2010

Schema mapping discovery from data instances.
J. ACM, 2010

Tractable database design and datalog abduction through bounded treewidth.
Inf. Syst., 2010

Distributed XML Design
CoRR, 2010

Bounded treewidth as a key to tractability of knowledge representation and reasoning.
Artif. Intell., 2010

Combining Semantic Web Search with the Power of Inductive Reasoning.
Proceedings of the Scalable Uncertainty Management - 4th International Conference, 2010

Tractable Query Answering over Conceptual Schemata (Extended Abstract).
Proceedings of the Eighteenth Italian Symposium on Advanced Database Systems, 2010

Inductive reasoning and semantic web search.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Query Answering under Non-guarded Rules in Datalog+/-.
Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

Balanced Queries: Divide and Conquer.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Querying the Guarded Fragment.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Semantic Web Search Based on Ontological Conjunctive Queries.
Proceedings of the Foundations of Information and Knowledge Systems, 2010

Query Answering under Expressive Entity-Relationship Schemata.
Proceedings of the Conceptual Modeling, 2010

Datalog+/-: A Family of Languages for Ontology Querying.
Proceedings of the Datalog Reloaded - First International Workshop, 2010

The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey.
Proceedings of the Fields of Logic and Computation, 2010

Query Rewriting under Non-Guarded Rules.
Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

Ontological Reasoning with F-logic Lite and its Extensions.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Wrapper Stability.
Proceedings of the Encyclopedia of Database Systems, 2009

Web Data Extraction System.
Proceedings of the Encyclopedia of Database Systems, 2009

Normalization and Optimization of Schema Mappings.
PVLDB, 2009

Scalable Web Data Extraction for Online Market Intelligence.
PVLDB, 2009

Generalized hypertree decompositions: NP-hardness and tractable variants.
J. ACM, 2009

Combining Semantic Web Search with the Power of Inductive Reasoning.
Proceedings of the Fifth International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2009), 2009

Service Marts.
Proceedings of the Search Computing: Challenges and Directions [outcome of the first SeCO Workshop on Search Computing Challenges and Directions, 2009

Web Data Extraction for Service Creation.
Proceedings of the Search Computing: Challenges and Directions [outcome of the first SeCO Workshop on Search Computing Challenges and Directions, 2009

Datalog+/-: A Unified Approach to Ontologies and Integrity Constraints.
Proceedings of the Seventeenth Italian Symposium on Advanced Database Systems, 2009

A General Datalog-Based Framework for Tractable Query Answering over Ontologies (extended abstract).
Proceedings of the Seventeenth Italian Symposium on Advanced Database Systems, 2009

Alternation as a programming paradigm.
Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Size and treewidth bounds for conjunctive queries.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

A general datalog-based framework for tractable query answering over ontologies.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Distributed XML design.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Datalog±: a unified approach to ontologies and integrity constraints.
Proceedings of the Database Theory, 2009

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Tractable Query Answering over Conceptual Schemata.
Proceedings of the Conceptual Modeling, 2009

Tractable Query Answering over Ontologies with Datalog+/-.
Proceedings of the 22nd International Workshop on Description Logics (DL 2009), 2009

Tree Projections: Game Characterization and Computational Aspects.
Proceedings of the Graph Theory, 2009

HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results.
Proceedings of the Graph Theory, 2009

Wormholes of Communication: Interfacing Virtual Worlds and the Real World.
Proceedings of the IEEE 23rd International Conference on Advanced Information Networking and Applications, 2009

Datalog Extensions for Tractable Query Answering over Ontologies.
Proceedings of the Semantic Web Information Management - A Model-Based Perspective, 2009

2008
A backtracking-based algorithm for hypertree decomposition.
ACM Journal of Experimental Algorithmics, 2008

Efficient core computation in data exchange.
J. ACM, 2008

Computational aspects of monotone dualization: A brief survey.
Discrete Applied Mathematics, 2008

Monadic Datalog over Finite Structures with Bounded Treewidth
CoRR, 2008

Width Parameters Beyond Tree-width and their Applications.
Comput. J., 2008

Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems.
Comput. J., 2008

On the complexity of deriving schema mappings from database instances.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Heuristic Methods for Hypertree Decomposition.
Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008

Taming the Infinite Chase: Query Answering under Expressive Relational Constraints.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Query Answering in the Description Logic Horn-.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

Taming the Infinite Chase: Query Answering under Expressive Relational Constraints.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

Uniform Constraint Satisfaction Problems and Database Theory.
Proceedings of the Complexity of Constraints, 2008

Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Combinatorial auctions with tractable winner determination.
SIGecom Exchanges, 2007

A logical approach to multicut problems.
Inf. Process. Lett., 2007

Hypertree width and related hypergraph invariants.
Eur. J. Comb., 2007

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions
CoRR, 2007

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Foundations of Rule-Based Query Answering.
Proceedings of the Reasoning Web, 2007

Monadic datalog over finite structures with bounded treewidth.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Generalized hypertree decompositions: np-hardness and tractable variants.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Complexity of Pure Equilibria in Bayesian Games.
Proceedings of the IJCAI 2007, 2007

Conditional Constraint Satisfaction: Logical Foundations and Complexity.
Proceedings of the IJCAI 2007, 2007

The Lixto Systems Applications in Business Intelligence and Semantic Web.
Proceedings of the Semantic Web: Research and Applications, 2007

Efficient Datalog Abduction through Bounded Treewidth.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
The DLV system for knowledge representation and reasoning.
ACM Trans. Comput. Log., 2006

Reasoning under minimal upper bounds in propositional logic.
Theor. Comput. Sci., 2006

Conjunctive queries over trees.
J. ACM, 2006

Second-Order Logic over Finite Structures - Report on a Research Programme.
Electronic Notes in Discrete Mathematics, 2006

Conjunctive Queries over Trees
CoRR, 2006

A Formal Comparison of Visual Web Wrapper Generators.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

RDF Querying: Language Constructs and Evaluation Methods Compared.
Proceedings of the Reasoning Web, 2006

Tractable database design through bounded treewidth.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Data exchange: computing cores in polynomial time.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

The Lixto Project: Exploring New Frontiers of Web Data Extraction.
Proceedings of the Flexible and Efficient Information Handling, 2006

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning.
Proceedings of the Proceedings, 2006

2005
Efficient algorithms for processing XPath queries.
ACM Trans. Database Syst., 2005

Complexity of propositional nested circumscription and nested abnormality theories.
ACM Trans. Comput. Log., 2005

Pure Nash Equilibria: Hard and Easy Games.
J. Artif. Intell. Res., 2005

The complexity of XPath query evaluation and XML typing.
J. ACM, 2005

Integrating Semi-structured Data into Business Applications: A Web Intelligence Example.
Proceedings of the Professional Knowledge Management, Third Biennial Conference, 2005

Hypertree Decompositions: Structure, Algorithms, and Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

The INFOMIX system for advanced integration of incomplete and inconsistent data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2005


Boosting Information Integration: The INFOMIX System.
Proceedings of the Thirteenth Italian Symposium on Advanced Database Systems, 2005

Information Extraction for the Semantic Web.
Proceedings of the Reasoning Web, 2005

Computing cores for data exchange: new algorithms and practical solutions.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005


Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Web Data Extraction for Business Intelligence: The Lixto Approach.
Proceedings of the Datenbanksysteme in Business, 2005

2004
Logic-based Web Information Extraction.
SIGMOD Record, 2004

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.
SIAM J. Comput., 2004

2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.
Theory Comput. Syst., 2004

Existential second-order logic over graphs: Charting the tractability frontier.
J. ACM, 2004

Monadic datalog and the expressive power of languages for Web information extraction.
J. ACM, 2004

Interactively Adding Web Service Interfaces to Existing Web Applications.
Proceedings of the 2004 Symposium on Applications and the Internet (SAINT 2004), 2004

Conjunctive Queries over Trees.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

The Lixto Data Extraction Project - Back and Forth between Theory and Practice.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Hypergraph Transversals.
Proceedings of the Foundations of Information and Knowledge Systems, 2004

Second-Order Logic over Finite Structures - Report on a Research Programme.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
XPath processing in a nutshell.
SIGMOD Record, 2003

XPath Processing in a Nutshell.
SIGMOD Record, 2003

New Results on Monotone Dualization and Generating Hypergraph Transversals.
SIAM J. Comput., 2003

Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width.
J. Comput. Syst. Sci., 2003

Guest Editor's Foreword.
J. Comput. Syst. Sci., 2003

On the complexity of single-rule datalog queries.
Inf. Comput., 2003

A Formal Comparison of Visual Web Wrapper Generators
CoRR, 2003

Pure Nash equilibria: hard and easy games.
Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), 2003

The complexity of XPath query evaluation.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Visual Programming of Web Data Aggregation Applications.
Proceedings of IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), 2003

XPath Query Evaluation: Improving Time and Space Efficiency.
Proceedings of the 19th International Conference on Data Engineering, 2003

Web Information Acquisition with Lixto Suite.
Proceedings of the 19th International Conference on Data Engineering, 2003

XPath Query Processing.
Proceedings of the Database Programming Languages, 9th International Workshop, 2003

2002
Datalog LITE: a deductive query language with linear time model checking.
ACM Trans. Comput. Log., 2002

Foreword.
Theor. Comput. Sci., 2002

Computing LOGCFL certificates.
Theor. Comput. Sci., 2002

Propositional default logics made easier: computational complexity of model checking.
Theor. Comput. Sci., 2002

Hypertree Decompositions and Tractable Queries.
J. Comput. Syst. Sci., 2002

New Results on Monotone Dualization and Generating Hypergraph Transversals
CoRR, 2002

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
CoRR, 2002

The DLV System for Knowledge Representation and Reasoning
CoRR, 2002

Complexity of Nested Circumscription and Nested Abnormality Theories
CoRR, 2002

Fixed-parameter complexity in AI and nonmonotonic reasoning.
Artif. Intell., 2002

Efficient Algorithms for Processing XPath Queries.
Proceedings of the VLDB 2002, 2002

New results on monotone dualization and generating hypergraph transversals.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction.
Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

Visual Data Extraction Through Visual Logic Programming.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

Monadic Queries over Tree-Structured Data.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

The DLV System.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

Hypergraph Transversal Computation and Related Problems in Logic and AI.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

Combining hypertree, bicomp, and hinge decomposition.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002

Multiagent Compromises, Joint Fixpoints, and Stable Models.
Proceedings of the Computational Logic: Logic Programming and Beyond, 2002

2001
On ACTL Formulas Having Linear Counterexamples.
J. Comput. Syst. Sci., 2001

The complexity of acyclic conjunctive queries.
J. ACM, 2001

Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models.
Inf. Comput., 2001

Complexity and expressive power of logic programming.
ACM Comput. Surv., 2001

Supervised Wrapper Generation with Lixto.
Proceedings of the VLDB 2001, 2001

Visual Web Information Extraction with Lixto.
Proceedings of the VLDB 2001, 2001

InfoPipes: A Flexible Framework for M-Commerce Applications.
Proceedings of the Technologies for E-Services, Second International Workshop, 2001

Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width.
Proceedings of the Nono Convegno Nazionale Sistemi Evoluti per Basi di Dati, 2001

The Lixto Wrapper Generation Tool.
Proceedings of the Nono Convegno Nazionale Sistemi Evoluti per Basi di Dati, 2001

Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width.
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

Hypertree Decompositions: A Survey.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

The Elog Web Extraction Language.
Proceedings of the Logic for Programming, 2001

Visual Web Information Extraction with Lixto.
Proceedings of the K-CAP 2001 Workshop on Knowledge Markup and Semantic Annotation Victoria, 2001

Complexity of Nested Circumscription and Abnormality Theories.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Second-Order Logic over Strings: Regular and Non-regular Fragments.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Report on PODS 2000.
SIGACT News, 2000

Existential second-order logic over strings.
J. ACM, 2000

Complexity results for some eigenvector problems.
Int. J. Comput. Math., 2000

A comparison of structural CSP decomposition methods.
Artif. Intell., 2000

On the Complexity of Theory Curbing.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
On the Complexity of Some Inductive Logic Programming Problems.
New Generation Comput., 1999

Succinctness as a Source of Complexity in Logical Formalisms.
Ann. Pure Appl. Logic, 1999

Enhancing Model Checking in Verification by AI Techniques.
Artif. Intell., 1999

Hypertree Decompositions and Tractable Queries.
Proceedings of the Atti del Settimo Convegno Nazionale Sistemi Evoluti per Basi di Dati, 1999

Hypertree Decompositions and Tractable Queries.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

On the Complexity of Single-Rule Datalog Queries.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Working with Arms: Complexity Results on Atomic Representations of Herbrand Models.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

A Comparison of Structural CSP Decomposition Methods.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Computing LOGCFL Certificates.
Proceedings of the Automata, 1999

On Tractable Queries and Constraints.
Proceedings of the Database and Expert Systems Applications, 10th International Conference, 1999

1998
Capturing Relativized Complexity Classes without Order.
Math. Log. Q., 1998

On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic.
J. Symb. Log., 1998

Hypertree Decompositions and Tractable Queries
CoRR, 1998

Existential Second-Order Logic over Strings.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

The Complexity of Acyclic Conjunctive Queries.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Disjunctive Datalog.
ACM Trans. Database Syst., 1997

Default Logic as a Query Language.
IEEE Trans. Knowl. Data Eng., 1997

Abduction from Logic Programs: Semantics and Complexity.
Theor. Comput. Sci., 1997

On the Indiscernibility of Individuals in Logic Programming.
J. Log. Comput., 1997

Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures.
J. Symb. Log., 1997

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions.
J. Log. Program., 1997

Well-Founded Semantics for Default Logic.
Fundam. Inform., 1997

Semantics and Complexity of Abduction from Default Theories.
Artif. Intell., 1997

The dlv System: Model Generator and Advanced Frontends (system description).
WLP, 1997

Modular Logic Programming and Generalized Quantifiers.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

On the Complexity of Some Inductive Logic Programming Problems.
Proceedings of the Inductive Logic Programming, 7th International Workshop, 1997

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Generalized Quantifiers in Logic Programs.
Proceedings of the Generalized Quantifiers and Computation, 1997

Complexity and Expressive Power of Logic Programming.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Extending Object-Oriented Systems with Roles.
ACM Trans. Inf. Syst., 1996

A Non-Ground Realization of the Stable and Well-Founded Semantics.
Theor. Comput. Sci., 1996

Mächtigkeit von Logikprogrammierung über Datenbanken.
KI, 1996

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
J. Comput. Syst. Sci., 1996

Approximating the Stable Model Semantics is Hard.
Fundam. Inform., 1996

Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations.
Fundam. Inform., 1996

Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems.
Ann. Pure Appl. Logic, 1996

Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract).
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

The PARK Semantics for Active Rules.
Proceedings of the Advances in Database Technology, 1996

Collapsing Oracle-Tape Hierarchies.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
The Complexity of Default Reasoning under the Stationary Fixed Point Semantics
Inf. Comput., August, 1995

Identifying the Minimal Transversals of a Hypergraph and Related Problems.
SIAM J. Comput., 1995

Translating Default Logic into Standard Autoepistemic Logic.
J. ACM, 1995

NP Trees and Carnap's Modal Logic.
J. ACM, 1995

The Complexity of Logic-Based Abduction.
J. ACM, 1995

On the Computational Cost of Disjunctive Logic Programming: Propositional Case.
Ann. Math. Artif. Intell., 1995

The Evolving Algebra Semantics of Class and Role Hierarchies.
Proceedings of the Semantics in Databases, 1995

Second Order Logic and the Weak Exponential Hierarchies.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Complexity Results for Abductive Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

Relativized Logspace and Generalized Quantifiers over Finite Structures
Proceedings of the Proceedings, 1995

Semantics and Complexity of Abduction from Default Theories.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Formalizing the Repair Process - Extended Report.
Ann. Math. Artif. Intell., 1994

Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity.
Artif. Intell., 1994

Complexity and Expressive Power of Disjunctive Logic Programming.
Proceedings of the Logic Programming, 1994

Adding Disjunction to Datalog.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

Default Logic as a Query Language.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

From Carnap's Modal Logic to Autoepistemic Logic.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics.
Proceedings of the Management and Processing of Complex Data Structures, Third Workshop on Information Systems and Artificial Intelligence, Hamburg, Germany, February 28, 1994

Causal Models of Disjunctive Logic Programs.
Proceedings of the Logic Programming, 1994

Disjunctive Logic Programming over Finite Structures.
Proceedings of the Innovationen bei Rechen- und Kommunikationssystemen, Eine Herausforderung für die Informatik, 24. GI-Jahrestagung im Rahmen des 13th World Computer Congress, IFIP Congress '94, Hamburg, 28. August, 1994

1993
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete.
Theor. Comput. Sci., 1993

Removing Redundancy from a Clause.
Artif. Intell., 1993

The Complexity of Logic-Based Abduction.
Proceedings of the STACS 93, 1993

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics.
Proceedings of the Logic Programming, 1993

Complexity Aspects of Various Semantics for Disjunctive Databases.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract).
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1993

The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

NP Trees and Carnap's Modal Logic
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Complexity Results for Nonmonotonic Logics.
J. Log. Comput., 1992

Reasoning with parsimonious and moderately grounded expansions.
Fundam. Inform., 1992

Selective Inheritance of Attribute Values in Relational Databases.
Discrete Applied Mathematics, 1992

On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
Artif. Intell., 1992

An Efficient Method for Eliminating Varying Predicates from a Circumscription.
Artif. Intell., 1992

On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

Complexity Results for Logic-Based Abduction.
Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic.
Proceedings of the Foundation of Knowledge Representation and Reasoning [the book grew out of an ECAI-92 workshop], 1992

Formaiizing the Repair Process.
ECAI, 1992

Complexity of Propositional Knowledge Base Revision.
Proceedings of the CNKBS'92, 1992

1991
On the Complexity of Clause Condensing.
Proceedings of the Proc. 7th Austrian Conference on Artificial Intelligence, 1991

Towards a Theory of the Repair Process.
Proceedings of the EPIA 91, 1991

1990
Investigations on Armstrong relations, dependency inference, and excluded functional dependencies.
Acta Cybern., 1990

Semantics of Object-Oriented Data Models - The Evolving Algebra Approach.
East/West Database Workshop, 1990

Hypothesis Classification, Abductive Diagnosis and Therapy.
Proceedings of the Expert Systems in Engineering, 1990

Physical Impossibility Instead of Fault Models.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, July 29, 1990

Logic Programming and Databases
Surveys in computer science, Springer, ISBN: 9783642839542, 1990

1989
Efficient Database Access from Prolog.
IEEE Trans. Software Eng., 1989

What you Always Wanted to Know About Datalog (And Never Dared to Ask).
IEEE Trans. Knowl. Data Eng., 1989

Magic Semi-Joins.
Inf. Process. Lett., 1989

On the Interaction between Transitive Closure and Functional Dependencies.
Proceedings of the MFDBS 89, 1989

ALGRES: An Extended Relational Database System for the Specification and Prototyping of Complex Applications.
Proceedings of the First Nordic Conference on Advanced Systems Engineering, 1989

1988
Properties and Update Semantics of Consistent Views.
ACM Trans. Database Syst., 1988

Closed World Databases Opened Through Null Values.
Proceedings of the Fourteenth International Conference on Very Large Data Bases, August 29, 1988

The Algres Project.
Proceedings of the Advances in Database Technology, 1988

1987
On the Size of Nonredundant FD-Covers.
Inf. Process. Lett., 1987

Subsumption and Implication.
Inf. Process. Lett., 1987

Computing Covers for Embedded Functional Dependencies.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
Optimizing Joins between Two Partitioned Relations in Distributed Databases.
J. Parallel Distrib. Comput., 1986

Taxonomy and formal properties of distributed joins.
Inf. Syst., 1986

Normalization of Relations and PROLOG.
Commun. ACM, 1986

Translation and Optimization of Logic Queries: The Algebraic Approach.
Proceedings of the VLDB'86 Twelfth International Conference on Very Large Data Bases, 1986

Interfacing Relational Databases and Prolog Efficiently.
Expert Database Conf., 1986

1985
On the Efficiency of Subsumption Algorithms
J. ACM, April, 1985

Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries.
IEEE Trans. Software Eng., 1985

Fast Subsumption Algorithms.
Proceedings of the EUROCAL '85, 1985

1984
Implementation of a Distributed File System on a Geographic Network of Personal Computers.
DDSS, 1984

1983
Joining Fragmented Relations in Distributed Databases.
Proceedings of the XP4.5 Workshop on Database Theory, 1983 Palo Alto, California, USA, 1983


  Loading...