Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Cowen, Robert | Kolany, Adam
Affiliations: Mathematics Department, Queens College, CUNY Flushing, NY 11367, USA | Theoretical Computer Science Department, Jagiellonian University, Gronostajowa 3, 30-072 Kraków, Poland
Abstract: Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ∩ e ≠Ø, for all e ∈ E and f ⊈σ, for all f ∈ F (see [8], [9]]). We give rules for deciding Property S, which generalizes the very successful Davis-Putnam rules for deciding satisfiability in propositional logic.
Journal: Fundamenta Informaticae, vol. 79, no. 1-2, pp. 5-15, 2007
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]