2540 search results - page 56 / 508 » Abstract Logics as Dialgebras |
176
click to vote
TCS
2011
15 years 1 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
166
click to vote
ECSQARU
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
156
click to vote
CONCUR
1993
Springer
15 years 10 months ago
1993
Springer
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...
323
click to vote
ASIAN
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
167
click to vote
AMAI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...