34 citations · 60 across the 4 of their papers we have counts for
Showing 2000 · cs.LOShow all
2 papers · 2 filters
cs.LO2000
Detecting Unsolvable Queries for Definite Logic Programs
Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal +1
In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachab…
cs.LO2000
A note on the Declarative reading(s) of Logic Programming
Marc Denecker
This paper analyses the declarative readings of logic programming. Logic programming - and negation as failure - has no unique declarative reading. One common view is that logic pr…