276 search results - page 22 / 56 » Representing Transition Systems by Logic Programs |
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
POPL
2010
ACM
13 years 10 months ago
2010
ACM
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
CLIMA
2006
13 years 9 months ago
2006
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...
LICS
1989
IEEE
13 years 11 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...