Sciweavers

959 search results - page 121 / 192
» Fundamental Concepts in Programming Languages
Sort
View
EOR
2011
113views more  EOR 2011»
14 years 6 months ago
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple game...
Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinow...
ALP
1997
Springer
15 years 4 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
IWFM
2000
167views Formal Methods» more  IWFM 2000»
15 years 1 months ago
An Algebraic Basis for Specifying and Enforcing Access Control in Security Systems
Security services in a multi-user environment are often based on access control mechanisms. Static of an access control policy can be formalised using abstract algebraic models. W...
Claus Pahl
ENTCS
2002
157views more  ENTCS 2002»
14 years 11 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
PADL
2004
Springer
15 years 5 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi