MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Nested Satisfiability." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

25 documents found, showing 1 through 10. Next 10 →

ATOM

The Effect Of Bounding The Number Of Primitive Propositions And The Depth Of Nesting
by Joseph Y. Halpern — 1995 — Artificial Intelligence
… of modal operators. If we restrict to finite nesting, then the satisfiability problem is NP…
Cited by 36 (3 self) – Add To MetaCart

On the Complexity of Conditional Logics
by Nir Friedman, Joseph Y. Halpern — 1994 — In Principles of Knowledge Representation and Reasoning: Proc. Fourth International Conference (KR '94
…, in general, deciding satisfiability is PSPACE-complete for formulas with arbitrary conditional nesting and NP…
Cited by 29 (4 self) – Add To MetaCart

Model Checking Branching Time Logics
by unknown authors
… direction, lower bounds tighter than NP- and coNP-hardness have been proved with new reductions from nested…
Add To MetaCart

Design of a Meta-Parallelizer for Large Scientific Applications
by Jean-yves Berthou, Domaine De Voluceau-rocquencourt — 1994
… plan. 5.1 Processing Parallelized Nests Satisfying the Inefficiency Criteria There are various…
Add To MetaCart

Model Checking Branching Time Logics
by Ph. Schnoebelen
… reductions from nested satisfiability problems [6, 10, 7]. In the other direction, new algorithms have been…
Add To MetaCart

On the Parallelization of Loop Nests Containing while Loops
by Christian Lengauer, Martin Griebl — 1995 — Proc. 1st Aizu Int. Symp. on Parallel Algorithm/Architecture Synthesis (pAs'95
… loop nest that satisfies the scannability condition. Note also that scannability does not imply…
Cited by 10 (7 self) – Add To MetaCart

Topology-Centric Look-Up Service
by L. Garces-Erice, K. W. Ross, E.W. Biersack, P. A. Felber, G. Urvoy-Keller
… group. We say that the collection G is a proper nesting if it satisfies all the following properties: 1…
Cited by 15 (5 self) – Add To MetaCart

A Communication Scheme for the Distributed Execution of Loop Nests with while Loops
by Martin Griebl, Christian Lengauer — 1995 — Int. J. Parallel Programming
…, scannable if it permits a target loop nest that satisfies the scannability condition. 4.3 Unscannability…
Cited by 2 (2 self) – Add To MetaCart

The Complexity of the Falsifiability Problem for Pure Implicational Formulas
by Peter Heusch, Peter Heusch — 1995 — Proc. 20th Int'l Symposium on Mathematical Foundations of Computer Science (MFCS'95), J. Wiedermann, P. Hajek (Eds.), Prague, Czech Republic. Lecture Notes in Computer Science (LNCS 969
… of Boolean formulas, for which the SAT-Problem has linear time complexity (Horn formulas, 2-SAT, nested…
Cited by 4 (1 self) – Add To MetaCart

Model checking CTL + and FCTL is hard
by F. Laroussinie, N. Markey, Ph. Schnoebelen — 2001 — In Proc. 4th Conf. Foundations of Software Science and Computation Structures, FOSSACS'01, volume 2030 of LNCS
… sequentially nested satisfiability), a logical problem with nested satisfiability questions, that is a…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB