Sciweavers

3658 search results - page 193 / 732
» The logic of proofs, semantically
Sort
View
NMELP
1994
15 years 10 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
ENTCS
2010
120views more  ENTCS 2010»
15 years 6 months ago
Simulation and Synthesis of Deduction Calculi
This paper gives an overview of two methods for automatically or semi-automatically generating deduction calculi from the semantic specification of a logic. One approach is based ...
Renate A. Schmidt
FUIN
2008
103views more  FUIN 2008»
15 years 6 months ago
LDYIS: a Framework for Model Checking Security Protocols
We present a formalism for the automatic verification of security protocols based on multi-agent systems semantics. We give the syntax and semantics of a temporal-epistemic securit...
Alessio Lomuscio, Wojciech Penczek
AAAI
1998
15 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
AAAI
1996
15 years 8 months ago
Splitting a Default Theory
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
Hudson Turner