Sciweavers

276 search results - page 10 / 56
» Representing Transition Systems by Logic Programs
Sort
View
CADE
2010
Springer
13 years 8 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
DATE
1997
IEEE
75views Hardware» more  DATE 1997»
13 years 12 months ago
Using constraint logic programming in memory synthesis for general purpose computers
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
Renate Beckmann, Jürgen Herrmann
POPL
2007
ACM
14 years 8 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
SEMWEB
2009
Springer
14 years 2 months ago
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
Ken Kaneiwa, Philip H. P. Nguyen
AMAI
2004
Springer
13 years 7 months ago
Extending Answer Sets for Logic Programming Agents
We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents...
Marina De Vos, Dirk Vermeir