4480 search results - page 24 / 896 » Prototyping Completion with Constraints Using Computational ... |
167
click to vote
AI
2004
Springer
15 years 3 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
223
click to vote
PRDC
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper describes the implementation of a processorgroup membership protocol in an experimental real-time network. The protocol is appropriate for fault-tolerant distributed sy...
115
click to vote
RSP
2005
IEEE
15 years 8 months ago
2005
IEEE
For cost-effective prototyping, system designers should have a clear understanding of the intended use of the prototype under development. This paper describes a classification of...
119
click to vote
SACMAT
2006
ACM
15 years 9 months ago
2006
ACM
Separation of Duty (SoD) is widely recognized to be a fundamental principle in computer security. A Static SoD (SSoD) policy states that in order to have all permissions necessary...
149
click to vote
JSC
2007
15 years 3 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...