Sciweavers

193 search results - page 3 / 39
» A Paraconsistent Higher Order Logic
Sort
View
FLOPS
1999
Springer
13 years 10 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
ECSQARU
2007
Springer
14 years 13 days ago
Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
In this paper, we propose an approach for measuring inconsistency in inconsistent ontologies. We first define the degree of inconsistency of an inconsistent ontology using a four...
Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin
LACL
2001
Springer
13 years 10 months ago
Combinators for Paraconsistent Attitudes
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...
Jørgen Villadsen
TPHOL
2007
IEEE
14 years 16 days ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
PPCP
1993
13 years 10 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning