899 search results - page 112 / 180 » A CTL-Based Logic for Program Abstractions |
95
Voted
ICFP
2002
ACM
16 years 14 days ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
135
click to vote
ARGMAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
SIGSOFT
2003
ACM
16 years 1 months ago
2003
ACM
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
96
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
92
Voted
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...