Sciweavers

1650 search results - page 95 / 330
» The HOM problem is decidable
Sort
View
CCCG
2001
13 years 11 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
DSS
2006
108views more  DSS 2006»
13 years 10 months ago
Matching observed behavior and modeled behavior: An approach based on Petri nets and integer programming
Inspired by the way SAP R/3 and other transactional information systems log events, we focus on the problem to decide whether a process model and a frequency profile "fit"...
Wil M. P. van der Aalst
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
13 years 4 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
CADE
2006
Springer
14 years 10 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
FOSSACS
2004
Springer
14 years 3 months ago
Reasoning about Dynamic Policies
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
Riccardo Pucella, Vicky Weissman