3572 search results - page 110 / 715 » Nominal Logic Programming |
85
Voted
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...
NMR
2004
Springer
15 years 6 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
92
Voted
FUIN
2006
15 years 19 days ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
120
Voted
CADE
2003
Springer
16 years 29 days ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
87
Voted
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...