Sciweavers

377 search results - page 26 / 76
» Modular logic metaprogramming
Sort
View
LICS
2007
IEEE
15 years 6 months ago
Pi-Calculus in Logical Form
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
Marcello M. Bonsangue, Alexander Kurz
AAAI
2008
15 years 2 months ago
Hyperequivalence of Logic Programs with Respect to Supported Models
Recent research in nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the st...
Miroslaw Truszczynski, Stefan Woltran
85
Voted
ECAI
2006
Springer
15 years 3 months ago
Elaborating Domain Descriptions
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
Andreas Herzig, Laurent Perrussel, Ivan José...
AISC
2004
Springer
15 years 5 months ago
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
Bruno Buchberger
96
Voted
OOPSLA
2007
Springer
15 years 5 months ago
Modular typestate checking of aliased objects
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
Kevin Bierhoff, Jonathan Aldrich