Sciweavers

977 search results - page 62 / 196
» Logic programming with infinite sets
Sort
View
99
Voted
TLDI
2003
ACM
15 years 5 months ago
The logical approach to stack typing
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...
Amal J. Ahmed, David Walker
LOPSTR
2005
Springer
15 years 6 months ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus
FOSSACS
2007
Springer
15 years 6 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
AMAI
2006
Springer
15 years 16 days ago
Answer set based design of knowledge systems
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
Marcello Balduccini, Michael Gelfond, Monica Nogue...
73
Voted
JAIR
2008
92views more  JAIR 2008»
15 years 14 days ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer