Sciweavers

4126 search results - page 473 / 826
» Set based logic programming
Sort
View
FOSSACS
2009
Springer
15 years 10 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
136
Voted
CSL
2007
Springer
15 years 10 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
ICLP
1997
Springer
15 years 8 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
AAAI
1996
15 years 5 months ago
Formalizing Narratives Using Nested Circumscription
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
Chitta Baral, Alfredo Gabaldon, Alessandro Provett...
147
Voted
ECOOPW
1997
Springer
15 years 8 months ago
The Object Model for a Product Based Development Process
The traditional workflow process model is typically illustrated with a graph of activities, tasks, deliverables and techniques. From an object-oriented perspective, every identifi...
Pavel Hruby