Sciweavers

155 search results - page 4 / 31
» Compositional Predicate Abstraction from Game Semantics
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 1 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
DATE
2007
IEEE
136views Hardware» more  DATE 2007»
14 years 1 months ago
Compositional specification of behavioral semantics
An emerging common trend in model-based design of embedded software and systems is the adoption of Domain-Specific Modeling Languages (DSMLs). While syntax metamodeling enables th...
Kai Chen 0003, Janos Sztipanovits, Sandeep Neema
LOPSTR
1998
Springer
13 years 11 months ago
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
Andreas Hamfelt, Jørgen Fischer Nilsson
VMCAI
2009
Springer
14 years 2 months ago
Mixed Transition Systems Revisited
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
Ou Wei, Arie Gurfinkel, Marsha Chechik
SEMWEB
2004
Springer
14 years 20 days ago
Dynamic Agent Composition from Semantic Web Services
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...