112 search results - page 9 / 23 » On the Expressiveness of Levesque's Normal Form |
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Prior work on computing queries from materialized views has focused on views defined by expressions consisting of selection, projection, and inner joins, with an optional aggrega...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
GG
2008
Springer
14 years 10 months ago
2008
Springer
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...
ISMVL
2000
IEEE
15 years 2 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...