Sciweavers

393 search results - page 15 / 79
» Logic Programs with Classical Negation
Sort
View
BSL
1999
103views more  BSL 1999»
13 years 7 months ago
The logic of bunched implications
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
Peter W. O'Hearn, David J. Pym
IAT
2008
IEEE
14 years 1 months ago
Towards a Fuzzy Answer Set Semantics for Residuated Logic Programs
In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation.
Nicolás Madrid, Manuel Ojeda-Aciego
ICFP
2000
ACM
13 years 11 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
PODS
1991
ACM
98views Database» more  PODS 1991»
13 years 11 months ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
IJCAI
2007
13 years 8 months ago
A Faithful Integration of Description Logics with Logic Programming
Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so ...
Boris Motik, Riccardo Rosati