Kim Marriott, Martin Odersky  Home/Search
Context Related
| unisa.edu.au/~cismx...negativetr.ps.gz diwww.epfl.ch/~oder...negativetr.ps.gz lampwww.epfl.ch/~od...negativetr.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unisa.edu.au/~cismxo/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Systems of Boolean constraints which allow negative constraints such as f 6` g are investigated. The results form a basis for algorithms to determine satisfiability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query decomposition, machine reasoning, and constraint logic programming. Proofs of the results rely on independence of inequations, which enables results for systems with a single inequation to be lifted to... (Update)
Cited by: More
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
Similar documents (at the sentence level):
5.9%: Constraint-Based Query Optimization for Spatial Databases - Richard Helm (1991) (Correct)
5.5%: Constraint-Based Query Optimization - For Spatial Databases (Correct)
Active bibliography (related documents): More All
0.3: Constraint Logic Programming: A Survey - Jaffar, Maher (1994) (Correct)
0.3: The Evaluation and the Computational Complexity of Datalog.. - Revesz (Correct)
0.2: Static Analysis of CLP Programs over Numeric Domains - Bagnara, Giacobazzi, Levi (1992) (Correct)
Similar documents based on text: More All
0.4: A Fragment Of Boole's Algebraic Logic Suitable For.. - Stanley Burr Is (Correct)
0.2: The Semantics of Constraint Logic Programs - Jaffar, Maher, Marriott, Stuckey (1996) (Correct)
0.1: From Local to Global Consistency in Temporal Constraint Networks - Koubarakis (1995) (Correct)
Related documents from co-citation: More All
3: Alias types for recursive data structures - Walker, Morrissett - 2000
3: Putting static analysis to work for verification: a case study - Lev-Ami, Reps et al. - 2000
3: Data refinement refined (context) - He, Hoare et al. - 1986
BibTeX entry: (Update)
Kim Marriott and Martin Odersky. Negative boolean constraints. Technical Report 94/203, Monash University, August 1994. http://citeseer.ist.psu.edu/marriott94negative.html More
@article{ marriott96negative,
author = "Kim Marriott and Martin Odersky",
title = "Negative {Boolean} constraints",
journal = "Theoretical Computer Science",
volume = "160",
number = "1--2",
pages = "365--380",
year = "1996",
url = "citeseer.ist.psu.edu/marriott94negative.html" }
Citations (may not include all citations):572 Computers and Intractability (context) - Garey, Johnson - 1979
561 Constraint logic programming (context) - Jaffar, Lassez - 1987
315 Constraint query languages - Kanellakis, Kuper et al. - 1990
261 An introduction to Prolog III (context) - Colmerauer - 1990
165 Theoretical Computer Science (context) - Kozen, Boolean - 1980
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
23 Embedding Boolean expressions into logic programming (context) - Buttner, Simonis - 1987
21 A constraint sequent calculus (context) - Lassez, McAloon - 1990
21 Boolean unification -- the story so far (context) - Martin, Nipkow - 1989
17 Kluwer Academic Publishers (context) - Brown, The et al. - 1990
16 Constraint-based query optimization for spatial databases - Helm, Marriott et al. - 1991
11 Propositional calculus problems in CHIP (context) - Simonis, Dincbas - 1990
8 Elsevier Science Publishers B (context) - Koppelberg, of et al. - 1989
7 Arithmetical classes and types of Boolean algebras (context) - Tarski - 1949
4 Spatial query optimization: From Boolean constraints to rang.. (context) - Helm, Marriott et al. - 1991
3 Reprinted by Philisophical Library (context) - Boole, of et al. - 1954
3 Elsevier Science Publishers B (context) - Rudeanu, Equations - 1974
1 Complexity of the theory of atomless Boolean algebras (context) - Berman - 1979
1 Dominoe games with an application to the complexity of Boole.. (context) - Gradel - 1988
1 Efficient processing of relational calculus using range quer.. (context) - Willard - 1984
Documents on the same site (http://www.cis.unisa.edu.au/~cismxo/papers/): More
Making the future safe for the past: Adding.. - Bracha, Odersky.. (1998) (Correct)
Two Ways to Bake Your Pizza - Translating Parameterised Types.. - Odersky (1997) (Correct)
Observers for Linear Types - Martin Odersky (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC