منابع مشابه
Łukasiewicz Games
Boolean games provide a simple, compact, and theoretically attractive abstract model for studying multi-agent interactions in settings where players will act strategically in an attempt to achieve personal goals. A standard critique of Boolean games, however, is that the binary nature of goals (satisfied or unsatisfied) inevitably trivialises the nature of such strategic interactions: a player ...
متن کاملLogics for Non-Cooperative Games with Expectations
We introduce the logics E(G) for reasoning about probabilistic expectation over classes G of games with discrete polynomial payoff functions represented by finite-valued Lukasiewicz formulas and provide completeness and complexity results. In addition, we introduce a new class of games where players’ expected payoff functions are encoded by E(G)-formulas. In these games each player’s aim is to ...
متن کاملŁukasiewicz Logics and Prime Numbers
A catalog record is available from the Library of Congress. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without permission in writing from the copyright holder. While every attempt is made to ensure that the information in this ...
متن کاملSymbolic Knowledge Extraction using Łukasiewicz Logics
This work describes a methodology that combines logic-based systems and connectionist systems. Our approach uses finite truth-valued Lukasiewicz logic, wherein every connective can be defined by a neuron in an artificial network [1]. This allowed the injection of first-order formulas into a network architecture, and also simplified symbolic rule extraction. For that we trained a neural networks...
متن کاملComplete Sets of Connectives for Generalized Łukasiewicz Logics
While ∧,∨,¬ form a complete set of connectives for classical propositional logic, this does not hold for Łukasiewicz’s three-valued propositional logic, nor its generalization to n-valued logic. We define a unary connective r so that ∧,∨,¬, r form a complete set of connectives for n-valued Łukasiewicz logic. We discuss generalizations of this to infinitary logics. If we allow infinite conjuncti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2019
ISSN: 0004-3702
DOI: 10.1016/j.artint.2019.03.003