472 search results - page 32 / 95 » Limiting Negations in Formulas |
148
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
161
click to vote
VMCAI
2010
Springer
16 years 6 days ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
100
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
We construct an Attribute-Based Encryption (ABE) scheme that allows a user’s private key to be expressed in terms of any access formula over attributes. Previous ABE schemes wer...
124
click to vote
CP
2005
Springer
15 years 4 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
119
click to vote
APAL
2008
15 years 3 months ago
2008
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...