 |
|
|
Item Details
| Title:
|
ANSWER SET PROGRAMMING FOR CONTINUOUS DOMAINS: A FUZZY LOGIC APPROACH
|
| By: |
Jeroen Janssen, Steven Schockaert, Dirk Vermeir |
| Format: |
Paperback |
| List price:
|
£94.50 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
946239041X |
| ISBN 13: |
9789462390416 |
| Publisher: |
ATLANTIS PRESS (ZEGER KARSSEN) |
| Pub. date: |
11 June, 2014 |
| Edition: |
2012 ed. |
| Series: |
Atlantis Computational Intelligence Systems 5 |
| Pages: |
174 |
| Synopsis: |
Answer set programming (ASP) is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied to e.g. planning problems, configuration and verification of software, diagnosis and database repairs. However, ASP is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision and investment portfolios. To overcome this problem we study FASP, a combination of ASP with fuzzy logic -- a class of manyvalued logics that can handle continuity. We specifically focus on the following issues:1. An important question when modeling continuous optimization problems is how we should handle overconstrained problems, i.e. problems that have no solutions. In many cases we can opt to accept an imperfect solution, i.e. a solution that does not satisfy all the stated rules (constraints). However, this leads to the question: what imperfect solutions should we choose? We investigate this question and improve upon the state-of-the-art by proposing an approach based on aggregation functions.2. Users of a programming language often want a rich language that is easy to model in. However, implementers and theoreticians prefer a small language that is easy to implement and reason about. We create a bridge between these two desires by proposing a small core language for FASP and by showing that this language is capable of expressing many of its common extensions such as constraints, monotonically decreasing functions, aggregators, S-implicators and classical negation.3. A well-known technique for solving ASP consists of translating a program P to a propositional theory whose models exactly correspond to the answer sets of P. We show how this technique can be generalized to FASP, paving the way to implement efficient fuzzy answer set solvers thatcan take advantage of existing fuzzy reasoners. |
| Illustrations: |
6 Tables, black and white; X, 174 p. |
| Publication: |
Netherlands |
| Imprint: |
Atlantis Press (Zeger Karssen) |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|