Sciweavers

3776 search results - page 259 / 756
» Partition-Based Logical Reasoning
Sort
View
ECAI
1998
Springer
15 years 8 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
NMELP
1994
15 years 8 months ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
ICLP
1992
Springer
15 years 8 months ago
A Declarative View of Inheritance in Logic Programming
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
Michele Bugliesi
CSL
1995
Springer
15 years 8 months ago
Improved Decision Procedures for the Modal Logics K, T, and S4
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
Jörg Hudelmaier
ICLP
1995
Springer
15 years 8 months ago
Type Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
Christoph Beierle