Sciweavers

37 search results - page 4 / 8
» Proving the Shalls
Sort
View
ECEH
2006
95views Healthcare» more  ECEH 2006»
13 years 7 months ago
Information Need and IT Demands for Business Process Reengineering in Operation Room Management
: As the economic importance of operation room (OR) management is increasing, the aim of this paper is to analyse the information need for business process reengineering (BPR) in O...
Anja Zöller, Christof Denz, Andre S. Baumgart...
LOGCOM
2000
93views more  LOGCOM 2000»
13 years 6 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
CADE
2005
Springer
14 years 6 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
ENDM
2007
140views more  ENDM 2007»
13 years 6 months ago
Acyclic dominating partitions
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
Louigi Addario-Berry, Ross J. Kang
CSL
2010
Springer
13 years 7 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek