Sciweavers

3470 search results - page 131 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
AGP
1994
IEEE
15 years 8 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
EUSFLAT
2001
15 years 6 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...
AAAI
2006
15 years 6 months ago
Unifying Logical and Statistical AI
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...
Pedro Domingos, Stanley Kok, Hoifung Poon, Matthew...
158
Voted
RR
2010
Springer
15 years 3 months ago
On the Semantic Relationship between Datalog and Description Logics
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...
Markus Krötzsch, Sebastian Rudolph, Peter H. ...
ICLP
1999
Springer
15 years 9 months ago
Binding-time Analysis for Mercury
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
Wim Vanhoof, Maurice Bruynooghe