Sciweavers

1020 search results - page 99 / 204
» Tight Semantics for Logic Programs
Sort
View
APN
2001
Springer
14 years 18 days ago
Partial Order Verification of Programmable Logic Controllers
We address the verification of programmable logic controllers (PLC). In our approach, a PLC program is translated into a special type of colored Petri net, a so-called register net...
Peter Deussen
ICFP
2006
ACM
14 years 9 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers
BIRTHDAY
2005
Springer
14 years 2 months ago
a-logic
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
Murdoch Gabbay, Michael Gabbay
JAIR
2010
160views more  JAIR 2010»
13 years 7 months ago
Reasoning About the Transfer of Control
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
Wiebe van der Hoek, Dirk Walther, Michael Wooldrid...
TARK
2005
Springer
14 years 2 months ago
First-order classical modal logic: applications in logics of knowledge and probability
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
Horacio L. Arló-Costa, Eric Pacuit