Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of Knowledge Representation and Reasoning (KRR). More recently, its attractive combination of a rich yet simple modeling language with high-performance solving capacities has sparked interest in many other areas even beyond KRR. This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems. Starting from the essential formal foundations, it introduces ASP's solving technology, modeling language and methodology, while illustrating the overall solving process by practical examples. Table of Contents: List of Figures / List of Tables / Motivation / Introduction / Basic modeling / Grounding / Characterizations / Solving / Systems / Advanced modeling / Conclusions

/pdf/answer-set-solving-in-practice-vtcfq8bjfw.pdf

Answer Set Solving in Practice

The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can support the Semantic Web and thus help to make this vision reality.

/pdf/description-logics-as-ontology-languages-for-the-semantic-1g2qrr6uxu.pdf

Description Logics as Ontology Languages for the Semantic Web

We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantified variables and eliminate universal variables by expansion. This process is continued until the formula becomes propositional and can be solved by any SAT solver. On structured problems our implementation quantor is competitive with state-of-the-art QBF solvers based on DPLL. It is orders of magnitude faster on certain hard to solve instances.

Resolve and expand

In this paper, we present an evaluation of four knowledge base systems (KBS) with respect to use in large OWL applications. To our knowledge, no experiment has been done with the scale of data used here. The smallest dataset used consists of 15 OWL files totaling 8MB, while the largest dataset consists of 999 files totaling 583MB. We evaluated two memory-based systems (OWL Jess KB and memory-based Sesame) and two systems with persistent storage (database-based Sesame and DLDB-OWL). We describe how we have performed the evaluation and what factors we have considered in it. We show the results of the experiment and discuss the performance of each system. In particular, we have concluded that existing systems need to place a greater emphasis on scalability.

/pdf/an-evaluation-of-knowledge-base-systems-for-large-owl-76khcnitbl.pdf

An evaluation of knowledge base systems for large OWL datasets

In this paper we present a fuzzy version of $\mathcal{SHOIN}$(D), the corresponding Description Logic of the ontology description language OWL DL. We show that the representation and reasoning capabilities of fuzzy $\mathcal{SHOIN}$(D) go clearly beyond classical $\mathcal{SHOIN}$(D). We present its syntax and semantics. Interesting features are that concrete domains are fuzzy and entailment and subsumption relationships may hold to some degree in the unit interval [0,1].

/pdf/towards-a-fuzzy-description-logic-for-the-semantic-web-4nb4igxktj.pdf

Towards a fuzzy description logic for the semantic web (preliminary report)

Invited Lectures.- Tableau Algorithms for Description Logics.- Modality and Databases.- Local Symmetries in Propositional Logic.- Comparison.- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison.- Consistency Testing: The RACE Experience.- Benchmark Analysis with FaCT.- MSPASS: Modal Reasoning by Translation and First-Order Resolution.- TANCS-2000 Results for DLP.- Evaluating *SAT on TANCS 2000 Benchmarks.- Research Papers.- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations.- A Tableau System for Godel-Dummett Logic Based on a Hypersequent Calculus.- An Analytic Calculus for Quantified Propositional Godel Logic.- A Tableau Method for Inconsistency-Adaptive Logics.- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning.- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics.- Variants of First-Order Modal Logics.- Complexity of Simple Dependent Bimodal Logics.- Properties of Embeddings from Int to S4.- Term-Modal Logics.- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics.- Dual Intuitionistic Logic Revisited.- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions.- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints.- Matrix-Based Inductive Theorem Proving.- Monotonic Preorders for Free Variable Tableaux.- The Mosaic Method for Temporal Logics.- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5.- A Tableau Calculus for Equilibrium Entailment.- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.- Tableau Calculus for Only Knowing and Knowing At Most.- A Tableau-Like Representation Framework for Efficient Proof Reconstruction.- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q.- System Descriptions.- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO.- E-SETHEO: An Automated3 Theorem Prover.

Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings

Roy Dyckhoff

Papers

Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings