A Generalized Decision Logic Language
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
When you're done, click "publish"
Only blue fields are mandatory.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
besides you has access to this list.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Full text for this article was not available? Send a request to the author(s)
: A Generalized Decision Logic Language
Abstract : A generalized decision logic language DGL is proposed for granular computing (GrC) in the Tarski's style through the notions of a model and satisfiability. The model is an information table consisting of a finite set of objects described by a finite set of attributes. A concept or a granule is characterized by a pair consisting of the intension of the concept, a formula of the language GDL, and the extension of the concept, a subset of the universe. We discuss the application of GDL in formal concepts and decision rules. The former deals with description and interpretation of granules, and the latter deals with the relationships between granules.
: Computer Science
Leave a comment
This contribution has not been reviewed yet. review?