Sciweavers

756 search results - page 26 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ASP
2005
Springer
15 years 3 months ago
Extending Conceptual Logic Programs with Arbitrary Rules
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
CONCUR
2004
Springer
15 years 3 months ago
A Semantics for Concurrent Separation Logic
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
Stephen D. Brookes
94
Voted
VSTTE
2010
Springer
14 years 8 months ago
Local Reasoning and Dynamic Framing for the Composite Pattern and Its Clients
Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmente...
Stan Rosenberg, Anindya Banerjee, David A. Naumann
78
Voted
DALT
2008
Springer
14 years 11 months ago
Inductive Negotiation in Answer Set Programming
This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptabl...
Chiaki Sakama
CADE
2010
Springer
14 years 10 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield