SOFSEM 2009 - PDF Preprint Papers

SOFSEM 2009 Seminar/Conference on Current Trends in Theory and Practice of Informatics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SOFSEM-2009 Paper

click to vote

SOFSEM
2009
Springer

157views Theoretical Computer Science» more SOFSEM 2009»

Expressiveness of Multiple Heads in CHR

14 years 8 months ago

Download www.cs.unibo.it

Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...

Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiar...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	157	Expressiveness of Multiple Heads in CHR	claim
2	153	-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games	claim
3	143	A Formal Model of Business Application Integration from Web Services (Position Paper)	claim
4	137	Automatic Bug Detection in Microcontroller Software by Static Program Analysis	claim
5	133	Event-Clock Visibly Pushdown Automata	claim
6	133	When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures	claim
7	128	Asynchronous Deterministic Rendezvous on the Line	claim
8	120	Partial Order Semantics of Types of Nets	claim
9	116	Adaptive Incentive-Compatible Sponsored Search Auction	claim
10	116	A Machine Checked Soundness Proof for an Intermediate Verification Language	claim
11	114	A Framework for Mutant Genetic Generation for WS-BPEL	claim
12	112	Abstract Storage Devices	claim
13	112	On Some SAT-Variants over Linear Formulas	claim
14	110	Can Component/Service-Based Systems Be Proved Correct?	claim
15	107	An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA	claim
16	106	Group Input Machine	claim
17	106	A Problem Kernelization for Graph Packing	claim
18	104	On Finite Bases for Weak Semantics: Failures Versus Impossible Futures	claim
19	100	Improved Algorithms for the 2-Vertex Disjoint Paths Problem	claim
20	98	Epistemic Strategies and Games on Concurrent Processes	claim
21	97	Conjunctive Grammars with Restricted Disjunction	claim
22	97	Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes	claim
23	96	The Shortcut Problem - Complexity and Approximation	claim
24	94	Time and Fairness in a Process Algebra with Non-blocking Reading	claim
25	94	Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression	claim
26	93	From Outermost Termination to Innermost Termination	claim
27	92	Unambiguous Erasing Morphisms in Free Monoids	claim
28	90	The Simple Reachability Problem in Switch Graphs	claim
29	90	On Toda's Theorem in Structural Communication Complexity	claim
30	89	On the Unification of Process Semantics: Observational Semantics	claim
31	86	Implementing Services by Partial State Machines	claim
32	86	Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams	claim
33	86	Symbolic Reachability Analysis of Integer Timed Petri Nets	claim
34	85	A New Family of Regular Operators Fitting with the Position Automaton Computation	claim
35	79	Randomness and Determination, from Physics and Computing towards Biology	claim
36	77	Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems	claim
37	73	Safe Reasoning with Logic LTS	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers