Thomas Drakengren, Peter Jonsson  Home/Search
Context Related
| ida.liu.se/pub/labs/tcslab/pet...J10.ps 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: ida.liu.se/~petej/Resea...article (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Automated reasoning about sets has received a considerable amount of interest in the literature. Techniques for such reasoning have been used in, for instance, analyses of programming languages, terminological logics and spatial reasoning. In this paper, we identify a new class of set constraints where checking satisfiability is tractable (i.e. polynomial-time). We show how to use this tractability result for constructing a new tractable fragment of intuitionistic logic. Furthermore, we prove... (Update)
Context of citations to this paper: More
...5.3, the existence of a 3DC model of Theta. 207 1 1 3 2 4 Y X Z Figure 2: The set fork(f1; 2; 4g) 6 Discussion Results by Drakengren and Jonsson [ 1996 ] show that algorithms similar to Horn SAT can be used for tractable inference in intuitionistic logic. This opens the way...
.... Horn clauses described in [Chandru and Hooker 1991] and the tractable set constraints described in [Drakengren 1997; Drakengren and Jonsson 1998; Drakengren and Jonsson 1997] In all of these cases our results lead to simpli cations of earlier proofs, and in many cases...
Cited by: More
Building Tractable Disjunctive Constraints - Cohen, Jeavons, Jonsson.. (2000) (Correct)
Qualitative Reasoning About Sets Applied to Spatial Reasoning - Peter Jonsson (1996) (Correct)
Similar documents (at the sentence level):
75.5%: Reasoning About Set Constraints Applied to Tractable.. - Drakengren, Jonsson (1996) (Correct)
75.2%: Algorithms and Complexity for Temporal and Spatial Formalisms - Drakengren (1997) (Correct)
Active bibliography (related documents): More All
0.4: Algorithms and Complexity for Temporal and Spatial Formalisms - .. - Drakengren (1997) (Correct)
0.3: Computational Complexity of Temporal Constraint Problems - Drakengren, Jonsson (1998) (Correct)
0.2: The Complexity of Set Constraints - Aiken, Kozen, Vardi, Wimmers (1993) (Correct)
Similar documents based on text: More All
0.3: A Complete Classification of Tractability in Allen's.. - Drakengren, Jonsson (1998) (Correct)
0.3: Eight Maximal Tractable Subclasses of Allen's Algebra with.. - Drakengren, Jonsson (1997) (Correct)
0.2: Towards a Complete Classification of Tractability in Allen's .. - Drakengren, Jonsson (1997) (Correct)
Related documents from co-citation: More All
2: A canonical form for generalized linear constraints (context) - Lassez, McAloon - 1992
BibTeX entry: (Update)
Thomas Drakengren and Peter Jonsson. Reasoning about set constraints applied to tractable inference in intuitionistic logic. Submitted journal manuscript, 1996. http://citeseer.ist.psu.edu/drakengren98reasoning.html More
@article{ drakengren98reasoning,
author = "Thomas Drakengren and Peter Jonsson",
title = "Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic",
journal = "Journal of Logic and Computation",
volume = "8",
number = "6",
pages = "855-875",
year = "1998",
url = "citeseer.ist.psu.edu/drakengren98reasoning.html" }
Citations (may not include all citations):480 An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
225 A spatial logic based on regions and connection - Randell, Cui et al. - 1992
207 Attributive concept descriptions with complements (context) - Schmidt-Schau, Smolka - 1991
197 The complexity of concept languages - Donini, Lenzerini et al. - 1991
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
131 Set Based Program Analysis - Heintze - 1992
82 A decision procedure for a class of set constraints - Heintze, Jaffar - 1990
64 the complexity of qualitative spatial reasoning: A maximal t.. - Renz, Nebel - 1997
63 Automatic computation of data set definitions (context) - Reynolds - 1969
61 Spatial reasoning with propositional logics - Bennett - 1994
52 Decidability of systems of set constraints with negative con.. - Aiken, Kozen et al. - 1994
50 Solving systems of set constraints with negated subset relat.. (context) - Gilleron, Tison et al. - 1993
50 Implementing regular tree expressions - Aiken, Murphy - 1991
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
36 Computational properties of qualitative spatial reasoning: F.. - Nebel - 1995
34 Intuitionism: An Introduction (context) - Heyting - 1971
34 Boolean algebras with operators (context) - J'onsson, Tarski - 1952
34 Boolean algebras with operators (context) - J'onsson, Tarski - 1951
32 An engine for logic program analysis - Heintze, Jaffar - 1992
31 A linear-programming approach to temporal reasoning - Jonsson, Backstrom - 1996
31 Directional type checking of logic programs - Aiken, Lakshman - 1994
30 space decision procedure for intuitionistic propositional lo.. (context) - Hudelmaier, nlogn - 1993
23 Mathematical Intuitionism: Introduction to Proof Theory (context) - Dragalin - 1988
22 Boosting the correspondence between description logics and p.. - De Giacomo, Lenzerini - 1994
17 Tarskian set constraints - Givan, Kozen et al. - 1996
14 A complete classification of tractability in RCC - Jonsson, Drakengren - 1997
10 Sentential calculus and topology (context) - Tarski - 1956
10 Intuitionistic logic is polynomial-space complete (context) - Statman - 1979
7 Systems of negative Boolean constraints (context) - Marriott, Odersky - 1992
4 Qualitative reasoning about sets applied to spatial reasonin.. - Jonsson, Drakengren - 1997
3 The basic concepts and constructions of general topology (context) - Arkhangelskii, Fedorchuk - 1990
3 Algorithms and Complexity for Temporal and Spatial Formalism.. - Drakengren - 1997
Documents on the same site (http://www.ida.liu.se/~petej/Research/article.html): More
Boolean Constraint Satisfaction: Complexity Results for.. - Jonsson (Correct)
Near-Optimal Nonapproximability Results for Some NPO PB-Complete.. - Jonsson (1998) (Correct)
Tractable Plan Existence Does Not Imply Tractable Plan.. - Jonsson, Bäckström (1998) (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