Sciweavers

438 search results - page 47 / 88
» On theorem proving in annotated logics
Sort
View
TPHOL
2007
IEEE
15 years 4 months 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
WWW
2009
ACM
15 years 4 months ago
Instance-based probabilistic reasoning in the semantic web
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
Pedro Oliveira, Paulo Gomes
CAISE
1999
Springer
15 years 2 months ago
Modeling Dynamic Domains with ConGolog
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. In ConGolog, the effects...
Yves Lespérance, Todd G. Kelley, John Mylop...
EUSFLAT
2001
14 years 11 months ago
Similarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
14 years 9 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal