Sciweavers

1448 search results - page 172 / 290
» Restricted Stack Implementations
Sort
View
CSCW
2002
ACM
13 years 9 months ago
A new dimension in access control: studying maintenance engineering across organizational boundaries
Inter-organizational cooperation has specific requirements for access control. The paper presents the results from a field study which looks at the cooperation between two enginee...
Gunnar Stevens, Volker Wulf
ENTCS
2007
123views more  ENTCS 2007»
13 years 9 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
INFORMATICALT
2002
72views more  INFORMATICALT 2002»
13 years 8 months ago
Simulation of Conflict in an Agent World: Access to Resources and Possibility of Termination of the Population
The goal of the paper is to create a model for investigating the character of relationships between the freedom and restrictions in the terrorism context, in order to find out how ...
Jaak Tepandi
LOGCOM
2010
123views more  LOGCOM 2010»
13 years 7 months ago
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Ulrich Furbach, Björn Pelz...
TCS
2010
13 years 7 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...