Sciweavers

8768 search results - page 374 / 1754
» Generalizing the notion of support
Sort
View
SLP
1994
89views more  SLP 1994»
15 years 9 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
ECAI
2010
Springer
15 years 8 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
CORR
2008
Springer
179views Education» more  CORR 2008»
15 years 7 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
ENTCS
2008
96views more  ENTCS 2008»
15 years 7 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 7 months ago
Modeling Adversaries in a Logic for Security Protocol Analysis
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
Joseph Y. Halpern, Riccardo Pucella