Sciweavers

235 search results - page 22 / 47
» A General Framework for Sound and Complete Floyd-Hoare Logic...
Sort
View
AAAI
1998
13 years 8 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
COMMA
2006
13 years 9 months ago
A dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first proposed for logic program...
Phan Minh Dung, Paolo Mancarella, Francesca Toni
CSL
2001
Springer
14 years 7 hour ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
POPL
2004
ACM
14 years 7 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
ANLP
2000
123views more  ANLP 2000»
13 years 8 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay