Guo-Qiang Zhang, William C. Rounds  Home/Search
Context Related
| uga.edu/~gqz/papers...smythpower.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: uga.edu/~gqz/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The purposes of this paper are (i) to give a new, efficient representation of Smyth powerdomains as 0-inhabited information systems, following the style of Scott; (ii) to introduce, as a consequence of this representation, a generalized resolution method for an arbitrary Smyth powerdomain and show the soundness and completeness of this method. The connection of (i) with (ii) comes from the observation that the elements of a Smyth powerdomain are semantically equivalent to the basic notion of... (Update)
Context of citations to this paper: More
...theory, then an ideal is proper exactly when it has a choice set. The proof of Theorem 2. 2 uses two basic facts about choice sets given in [16]: ffl a theory not containing the empty clause always has a minimal choice set. ffl Moreover, a minimal choice set of a theory has the...
...compact, saturated sets. Each disjunctive state C is mapped to [ C] consisting of the ideal elements of A that are choice sets (see [12] or Section 4.1) of C. We use Hofmann Mislove Theorem to show that [ C] is a compact, saturated set. A combinatorial argument (see Section...
Cited by: More
An Information-System Representation Of The Smyth Powerdomain - Zhang, Rounds (1999) (Correct)
Clause-Logical Aspects of the Smyth Powerdomain (Extended.. - Zhang, Rounds (Correct)
Active bibliography (related documents): More All
0.6: The Largest Cartesian Closed Category of Stable Domains - Zhang (Correct)
0.3: Quasi-Prime Algebraic Domains - Zhang (1996) (Correct)
0.3: A Satisfiability Checker for Difference Logic - Mahfoudh, Niebert, Asarin, Maler (2002) (Correct)
Similar documents based on text: More All
0.7: Ruu-Cs-93-02 - Padualaan Box Tb (1993) (Correct)
0.5: A Note on the Smyth Powerdomain Construction - Knijnenburg (1993) (Correct)
0.4: 2-Stage Fixed-Point Iteration in a Modified Plotkin Powerdomain - Mogensen (1997) (Correct)
Related documents from co-citation: More All
2: Theoretical Computer Science (context) - Winskel - 1984
2: Complexity of power default reasoning - Zhang, Rounds - 1997
2: Domain theory - Abramsky, Jung - 1994
BibTeX entry: (Update)
G.-Q. Zhang and W. Rounds, Resolution in the Smyth powerdomain, Proceedings of the 13rd International Conference on Mathematical Foundations of Programming Semantics (MFPS'97), ENTCS, Volume 6, (14 pages) 1997. http://citeseer.ist.psu.edu/zhang98resolution.html More
@misc{ zhang97resolution,
author = "G. Zhang and W. Rounds",
title = "Resolution in the Smyth powerdomain",
text = "G.-Q. Zhang and W. Rounds, Resolution in the Smyth powerdomain, Proceedings
of the 13rd International Conference on Mathematical Foundations of Programming
Semantics (MFPS'97), ENTCS, Volume 6, (14 pages) 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/zhang98resolution.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
224 Semantics of Programming Languages -- Structures and Techniq.. (context) - Gunter - 1992
214 Domains for denotational semantics (context) - Scott - 1982
211 Domain theory - Abramsky, Jung - 1995
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
192 Logic programming (context) - Apt - 1990
72 Journal of Computer and Systems Science (context) - Smyth - 1977
58 Theoretical Computer Science (context) - Winskel, powerdomains - 1985
41 Using information systems to solve recursive domain equation.. (context) - Winskel, Larsen - 1984
17 The generalized resolution principle (context) - Robinson - 1968
11 Progress in Theoretical Computer Science (context) - Zhang, Domains - 1991
8 Information and Computation (context) - Zhang, of - 1994
6 dI-domains as prime information systems (context) - Zhang - 1992
6 Universal information systems (context) - Droste, Gobel - 1990
3 The Davis-Putnam resolution procedure (context) - Zhang - 1995
2 Quasi-prime algebraic domains - Zhang - 1996
Documents on the same site (http://www.cs.uga.edu/~gqz/research.html): More
Parallel Product Of Event Structures - Castellani, Zhang (1997) (Correct)
Nonmonotonic Consequences In Default Domain Theory - Zhang, Rounds (Correct)
Experimenting with Power Default Reasoning - Klavins, Rounds, Zhang (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