Sciweavers

3047 search results - page 104 / 610
» On the Meaning of Logical Completeness
Sort
View
STACS
2007
Springer
14 years 5 months ago
Bounded-Variable Fragments of Hybrid Logics
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
Thomas Schwentick, Volker Weber
LPNMR
2005
Springer
14 years 4 months ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
Yin Chen, Fangzhen Lin, Lei Li
TABLEAUX
2005
Springer
14 years 4 months ago
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
Jens Otten
IJCAI
2003
14 years 11 days ago
Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies
Current Description Logic reasoning systems provide only limited support for debugging logically erroneous knowledge bases. In this paper we propose new non-standard reasoning ser...
Stefan Schlobach, Ronald Cornet
CADE
2010
Springer
14 years 3 days ago
Classical Logic with Partial Functions
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
Hans de Nivelle