1017 search results - page 168 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...
144
click to vote
ICTL
1994
15 years 1 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
90
Voted
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...