330 search results - page 34 / 66 » On Modular Termination Proofs of General Logic Programs |
JAIR
2011
13 years 2 months ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
COMMA
2010
13 years 2 months ago
2010
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
OOPSLA
2007
Springer
14 years 2 months ago
2007
Springer
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...
CSL
2001
Springer
14 years 13 days ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...