Sciweavers

746 search results - page 138 / 150
» Connectionist Propositional Logic
Sort
View
TACAS
2007
Springer
124views Algorithms» more  TACAS 2007»
15 years 4 months ago
Deciding Bit-Vector Arithmetic with Abstraction
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
Randal E. Bryant, Daniel Kroening, Joël Ouakn...
BIRTHDAY
2005
Springer
15 years 3 months ago
Compiled Labelled Deductive Systems for Access Control
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
Krysia Broda, Alessandra Russo
CEFP
2005
Springer
15 years 3 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond
ICLP
2005
Springer
15 years 3 months ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran
AUSAI
2004
Springer
15 years 3 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...