Sciweavers

1795 search results - page 163 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CAISE
1999
Springer
14 years 1 months ago
Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
Wasim Sadiq, Maria E. Orlowska
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
14 years 23 days ago
Object Modeling with Guaranteed Fulfillment of Geometric Constraints
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
Da-Chuan Cheng, Xiaoyi Jiang
FOSSACS
2006
Springer
14 years 20 days ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
ACL
2004
13 years 10 months ago
An Empirical Study of Information Synthesis Task
This paper describes an empirical study of the "Information Synthesis" task, defined as the process of (given a complex information need) extracting, organizing and inte...
Enrique Amigó, Julio Gonzalo, Víctor...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 9 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...