Sciweavers

78 search results - page 8 / 16
» A logical reconstruction of SPKI
Sort
View
AAAI
1994
13 years 8 months ago
Reasoning about Priorities in Default Logic
In this paper we argue that for realistic applications involving default reasoning it is necessary to reason about the priorities of defaults. Existing approaches require the know...
Gerhard Brewka
AAAI
1994
13 years 8 months ago
Recovering Software Specifications with Inductive Logic Programming
We consider using machine learning techniques to help understand a large software system. In particular, we describe how learning techniques can be used to reconstruct abstract Da...
William W. Cohen
CADE
2006
Springer
14 years 7 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
LPAR
2010
Springer
13 years 5 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson