Synthesising Features by Games | Zendy

Dimitar P. Guelev | Zendy; Mark Ryan | Zendy; PierreYves Schobbens | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Synthesising Features by Games

Author(s) -

Dimitar P. Guelev,

Mark Ryan,

PierreYves Schobbens

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.10.006

Subject(s) - property (philosophy) , feature (linguistics) , computer science , set (abstract data type) , theoretical computer science , parity (physics) , base (topology) , algorithm , mathematics , programming language , mathematical analysis , philosophy , linguistics , physics , epistemology , particle physics

We describe an algorithmic method for the synthesis of features. The method takes as input a base system, a triggering condition for the feature, a set of system variables which the feature is allowed to update, and a requirement on the result of integrating it. It computes whether a feature of the given form and with the desired property exists and, if so, a construction of it. The method is based on the theory of infinite parity games

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research