2022 search results - page 202 / 405 » Complexity of Non-Monotonic Logics |
168
click to vote
PPDP
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
168
click to vote
CSFW
2008
IEEE
16 years 1 months ago
2008
IEEE
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
174
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used f...
149
click to vote
CIE
2007
Springer
16 years 21 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
188
click to vote
CSL
2007
Springer
16 years 21 days ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...