Sciweavers

28 search results - page 5 / 6
» On the Logic of Theory Change: Contraction without Recovery
Sort
View
ARGMAS
2004
Springer
14 years 26 days ago
Revising Beliefs Through Arguments: Bridging the Gap Between Argumentation and Belief Revision in MAS
This paper compares within the MAS framework two separate threads in the formal study of epistemic change: belief revision and argumentation theories. Belief revision describes how...
Fabio Paglieri, Cristiano Castelfranchi
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
14 years 4 months ago
Single-Pass Redundancy Addition and Removal
Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removab...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
WECWIS
2003
IEEE
97views ECommerce» more  WECWIS 2003»
14 years 22 days ago
Matchmaking for Business Processes
Web services have a potential to enhance B2B ecommerce over the Internet by allowing companies and organizations to publish their business processes on service directories where p...
Andreas Wombacher, Peter Fankhauser, Bendick Mahle...
PLDI
2003
ACM
14 years 21 days ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...