Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In this paper, we introduce a sequent-type calculus for a variant of default logic employing ...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In this paper, we introduce a sequent-type calculus for a variant of default logic employing Lukasiewicz's three-valued logic as the underlying base logic. This version of default logic has been introduced by Radzikowska addressing some representational shortcomings of standard default logic. More specifically, our calculus axiomatises brave reasoning for this version of default logic, following the sequent method first introduced in the context of nonmonotonic reasoning by Bonatti, which employs a complementary calculus for axiomatising invalid formulas, taking care of expressing the consistency condition of defaults.
Satisfiability Modulo Theories (SMT) is a well-established methodology that generalises propositional satisfiability (SAT) by adding support for a variety of theories such as integer arithmetic and bit-vector operatio...
详细信息
Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning;its most central conce...
详细信息
Answer Set programming (ASP) is a well-established declarative programming language based on logic. The success of ASP is mainly due to the availability of efficient ASP solvers, therefore their development is still a...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Answer Set programming (ASP) is a well-established declarative programming language based on logic. The success of ASP is mainly due to the availability of efficient ASP solvers, therefore their development is still an important research topic. In this paper we report the recent improvements of the well-known ASP solver WASP. The new version of WASP includes several improvements of the main solving strategies and advanced reasoning techniques for computing paracoherent answer sets. Indeed, WASP is the first ASP solver handling paracoherent reasoning under two mainstream semantics, namely semi-stable and semiequilibrium. However, semi-equilibrium semantics may require the introduction of several disjunctive rules, which are usually considered as a source of inefficiency for modern solvers. Such a drawback is addressed in WASP by implementing ad-hoc techniques to efficiently handle disjunctive logic programs. These techniques are presented and evaluated in this paper.
Get started creating video games using Unreal Engine 4 (UE4) and learning the fundamentals of game development. Through hands-on, step-by-step tutorials, you will learn to design engaging environments and a build soli...
详细信息
ISBN:
(数字)9781484256398
ISBN:
(纸本)9781484256381
Get started creating video games using Unreal Engine 4 (UE4) and learning the fundamentals of game development. Through hands-on, step-by-step tutorials, you will learn to design engaging environments and a build solid foundation for more complex games. Discover how to utilize the 3D game design software behind the development of immensely popular games for PC, console, and mobile. Beginning Unreal Game Development steers you through the fundamentals of game development with UE4 to design environments that both engage the player and are aesthetically pleasing. Author David Nixon shows you how to script logic, define behaviors, store data, and create characters. You will learn to create user interfaces, such as menus, load screens, and head-up displays (HUDs), and manipulate audio to add music, sound effects, and dialogue to your game. The book covers level editors, actor types, blueprints, character creation and control, and much more. Throughout the book, you'll put theory into practice and create an actual game using a series of step-by-step tutorials. With a clear, step-by-step approach, Beginning Unreal Game Development builds up your knowledge of Unreal Engine 4 so you can start creating and deploying your own 3D video games in no time. What You Will Learn, Learn the fundamentals of game design; Understand how to use Unreal Engine 4; Design amazing levels for your characters to play in; Script logic to control the behavior of the world you create. Who This Book Is For, This book is for beginners with no prior game design or programming experience. It is also intended for video game enthusiasts who are brand-new to the world of game development and want to learn how to design a game from scratch using UE4.
In this paper we introduce a framework built on top of the Knowledge Base System IDP, which allows local search heuristics to be synthesized from their formal descriptions. It is introduced as a new inference to solve...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
In this paper we introduce a framework built on top of the Knowledge Base System IDP, which allows local search heuristics to be synthesized from their formal descriptions. It is introduced as a new inference to solve optimization problems in IDP. To model a local search heuristic, users need to specify its components, among which neighbourhood moves are the most important. Two types of neighbourhood moves, namely standard moves and Large Neighbourhood Search moves, are supported. A set of built-in local search heuristics are provided, allowing users to combine neighbourhoods in different ways. We demonstrate how the new local search inference can be used to complement the existing solving mechanisms for logicprogramming.
Our ultimate goal is to conceive an extension of Answer Set programming with language constructs from dynamic (and temporal) logic to provide an expressive computational framework for modeling dynamic applications. To...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Our ultimate goal is to conceive an extension of Answer Set programming with language constructs from dynamic (and temporal) logic to provide an expressive computational framework for modeling dynamic applications. To address this in a semantically well founded way, we generalize the definition of Dynamic Equilibrium logic to accommodate finite linear time and extend it with a converse operator in order to capture past temporal operators. This results in a general logical framework integrating existing dynamic and temporal logics of Here-and-There over both finite and infinite time. In the context of finite time, we then develop a translation of dynamic formulas into propositional ones that can in turn be translated into logic programs.
We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning ...
详细信息
We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.
Recently there has been an increasing interest in frameworks extending Dung’s abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Altho...
详细信息
This paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). The graphs show how a literal can be derived ...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
This paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). The graphs show how a literal can be derived from the program, and they evaluate in an argumentative way why necessary assumptions about literals not contained in an answer set hold. With the set of all asl-explanation graphs for a literal and an answer set, it is possible to explain and justify thoroughly why the literal is or is not contained in that answer set. Additionally, we provide a criterion to improve the clarity of explanations by pruning nodes without loss of information and selecting most significant asl-explanation graphs.
暂无评论