Answer set programming continuous di janssen jeroen (13 risultati)
Answer Set Programming for Continuous Domains: A F
Janssen, Jeroen; Schockaert, Steven; Vermeir, Dirk; De Cock, Martine
- Rilegato
Da: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 98,25
Spedizione gratuitaSpedito in U.S.A.Quantità: 10 disponibili
Condizione: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service.
- Rilegato
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 143,63
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 184.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 95,25
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach | Jeroen Janssen (u. a.) | Taschenbuch | x | Englisch | 2014 | Atlantis Press | EAN 9789462390416 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot…]com | Anbieter: preigu.
Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach
Jeroen Janssen, Martine De Cock, Dirk Vermeir, Steven Schockaert
- Rilegato
Da: Buchpark, Trebbin, GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 83,61
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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 rep…airs. 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.
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 182,20
EUR 14,62 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. 2012 edition. 184 pages. 9.30x6.20x0.50 inches. In Stock.
Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach (Atlantis Computational Intelligence Systems, 5)
Janssen, Jeroen, Schockaert, Steven, Vermeir, Dirk, De Cock,
- Rilegato
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 185,56
EUR 29,25 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Rilegato
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 106,99
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 dat…abase 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. 184 pp. Englisch.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 106,99
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 184 pp. Englisch.
Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach
Jeroen Janssen|Steven Schockaert|Dirk Vermeir|Martine De Cock
- Rilegato
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 92,27
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contains an extensive survey on the current state-of-the-art w.r.t. the combination of answer set programming with continuous logics Shows how answer set programming can be used for solving continuous domains with re…al-world examples Contains a chapter deta.
- Rilegato
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 148,17
EUR 7,60 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 184 8 Illus.
- Rilegato
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 151,96
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 184.
- Rilegato
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 95,70
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Buch. Condizione: Neu. Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach | Jeroen Janssen (u. a.) | Buch | Atlantis Computational Intelligence Systems | x | Englisch | 2012 | Atlantis Press | EAN 9789491216589 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juer…gen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
- Rilegato
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 106,99
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 databas…e 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 184 pp. Englisch.
