Back to Results
First PageMeta Content
Morphisms / Category / Sheaf / Epimorphism / Initial and terminal objects / Graph rewriting / Additive category / Multicategory / Abstract algebra / Mathematics / Category theory


GT-VC[removed]An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (Long Version) 1,2
Add to Reading List

Document Date: 2007-08-08 08:19:07

Open Document

File Size: 402,58 KB

Share Result on Facebook

Company

Correct Graph Transformation Systems / Trustworthy Software Systems / /

Currency

pence / /

/

Facility

University of Twente / Computing Science University / /

Holiday

Assumption / /

IndustryTerm

satisfiability algorithm / transformation systems / correct and complete algorithm / rule applications / monotone algorithm / /

Organization

German Research Foundation / Graduate School / Karl-Heinz Pennemann Department / University of Twente / Computing Science University of Oldenburg D-26111 Oldenburg / /

Person

Arend Rensink / /

Position

mP / author / morphism mP / depth-first interpreter / pushout hB / pullback hB / /

ProgrammingLanguage

R / C / K / L / /

Technology

satisfiability algorithm / dom / monotone algorithm / 2007 An Algorithm / presented algorithm / /

URL

www.elsevier.nl/locate/entcs / /

SocialTag