Sciweavers

3738 search results - page 100 / 748
» Parametrized Logic Programming
Sort
View
APLAS
2007
ACM
14 years 1 days ago
Call-by-Name and Call-by-Value in Normal Modal Logic
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
Yoshihiko Kakutani
LPNMR
2005
Springer
14 years 1 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
POPL
2010
ACM
14 years 5 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
DALT
2006
Springer
13 years 11 months ago
A Functional Program for Agents, Actions, and Deontic Specifications
We outline elements of the Abstract Contract Calculator, a prototype language implemented in Haskell (a declarative programming language) in which we simulate agents executing abst...
Adam Zachary Wyner
JOLLI
2008
145views more  JOLLI 2008»
13 years 8 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack