This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During...
详细信息
This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During search, every state encountered is tabled, and tabled states are used to effectively perform resource-bounded search. In Picat, structured data can be used to avoid enumerating all possible permutations of objects, and term sharing is used to avoid duplication of common state data. This paper presents several modeling techniques through the example models, ranging from designing state representations to facilitate data sharing and symmetry breaking, encoding actions with operations for efficient precondition checking and state updating, to incorporating domain knowledge and heuristics. Broadly, this paper demonstrates the effectiveness of tabled logicprogramming for planning, and argues the importance of modeling despite recent significant progress in domain-independent PDDL planners.
This book is a comprehensive introduction to LabVIEW FPGA, a package allowing the programming of intelligent digital controllers in field programmable gate arrays (FPGAs) using graphical code. It shows how both potent...
详细信息
ISBN:
(数字)9783319266565
ISBN:
(纸本)9783319266558
This book is a comprehensive introduction to LabVIEW FPGA, a package allowing the programming of intelligent digital controllers in field programmable gate arrays (FPGAs) using graphical code. It shows how both potential difficulties with understanding and programming in VHDL and the consequent difficulty and slowness of implementation can be sidestepped. The text includes a clear theoretical explanation of fuzzy logic (type 1 and type 2) with case studies that implement the theory and systematically demonstrate the implementation process. It goes on to describe basic and advanced levels of programming LabVIEW FPGA and show how implementation of fuzzy-logic control in FPGAs improves system responses. A complete toolkit for implementing fuzzy controllers in LabVIEW FPGA has been developed with the book so that readers can generate new fuzzy controllers and deploy them immediately. Problems and their solutions allow readers to practice the techniques and to absorb the theoretical ideas as they arise. Fuzzy logic Type 1 and Type 2 Based on LabVIEW FPGA, helps students studying embedded control systems to design and program those controllers more efficiently and to understand the benefits of using fuzzy logic in doing so. Researchers working with FPGAs find the text useful as an introduction to LabVIEW and as a tool helping them design embedded systems.
Disjunctive Answer Set programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretic...
详细信息
Disjunctive Answer Set programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.
In this paper we provide an alternative semantics for Equilibrium logic and its monotonic basis, the logic of Here-and-There (also known as Godel's G(3) logic) that relies on the idea of denotation of a formula, t...
详细信息
In this paper we provide an alternative semantics for Equilibrium logic and its monotonic basis, the logic of Here-and-There (also known as Godel's G(3) logic) that relies on the idea of denotation of a formula, that is, a function that collects the set of models of that formula. Using the three-valued logic G(3) as a starting point and an ordering relation (for which equilibrium/stable models are minimal elements) we provide several elementary operations for sets of interpretations. By analysing structural properties of the denotation of formulas, we show some expressiveness results for G(3) such as, for instance, that conjunction is not expressible in terms of the other connectives. Moreover, the denotational semantics allows us to capture the set of equilibrium models of a formula with a simple and compact set expression. We also use this semantics to provide several formal definitions for entailment relations that are usual in the literature, and further introduce a new one called strong entailment. We say that alpha strongly entails beta when the equilibrium models of alpha boolean AND gamma are also equilibrium models of beta boolean AND gamma for any context gamma. We also provide a characterisation of strong entailment in terms of the denotational semantics, and give an example of a sufficient condition that can be applied in some cases.
Purpose - International development practice has had as its dominant paradigm the rational-analytic model of project planning, management and evaluation. This is reflected in the widespread adoption by donor agencies ...
详细信息
Purpose - International development practice has had as its dominant paradigm the rational-analytic model of project planning, management and evaluation. This is reflected in the widespread adoption by donor agencies of results-based management (RBM), side by side with conventionally used tools for monitoring and evaluation (including logical framework analysis ("logframe"), logic model and results frameworks). Donor agencies rely upon such tools to generate the evidence base for measuring "success" across the spectrum of their work, even though projects differ enormously in their nature, scope and time-span. Process- led capacity development projects and input-led infrastructural or straightforward service delivery projects require very different yardsticks of performance monitoring and appraisal. Drawing on insights from the complex adaptive systems (CAS) literature, the purpose of this paper is to explore how projects focused on capacity development necessitate a more eclectic approach, including - but not restricted to - RBM methodology. Design/methodology/approach - Using the insights of CAS theory, and with particular reference to projects which have capacity development as their prime focus, this paper explores a broadening of conventional project management practices. Findings - The paper posits an integrative approach to managing international development projects focused on capacity development - one which would recognise the values of instrumental utility and goal-setting associated with the application of the tools of RBM, while situating that within a more open, system focused and holistic approach to projects and their outcomes, placing emphasis on context, adaptability and learning. Research limitations/implications - The research enquiry presented is discursive rather than empirical, and builds on established theory and constructs of three distinct conceptual fields: first, the RBM approach to project and programme implementation;second, the "complex
Learning probabilistic logicprogramming languages is receiving an increasing attention, and systems are available for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both structure and parameter...
详细信息
Learning probabilistic logicprogramming languages is receiving an increasing attention, and systems are available for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both structure and parameters (SEM-CP-logic and SLIPCASE) of these languages. In this paper we present the algorithm SLIPCOVER for "Structure LearnIng of Probabilistic logic programs by searChing OVER the clause space." It performs a beam search in the space of probabilistic clauses and a greedy search in the space of theories using the log likelihood of the data as the guiding heuristics. To estimate the log likelihood, SLIPCOVER performs Expectation Maximization with EMBLEM. The algorithm has been tested on five real world datasets and compared with SLIPCASE, SEM-CP-logic, Aleph and two algorithms for learning Markov logic Networks (Learning using Structural Motifs (LSM) and ALEPH++ExactL1). SLIPCOVER achieves higher areas under the precision-recall and receiver operating characteristic curves in most cases.
The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set programming (...
详细信息
The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.
Manufacturing Resources Planning (MRPII) systems are unable to prevent capacity problems occurring on the shop floor because of the fixed lead time and backward scheduling logic. For this reason, a new breed of concep...
详细信息
Manufacturing Resources Planning (MRPII) systems are unable to prevent capacity problems occurring on the shop floor because of the fixed lead time and backward scheduling logic. For this reason, a new breed of concepts called APS (Advanced Planning and Scheduling) systems emerged which include finite capacity planning at the shop floor level through constraint based planning. In this paper, we present a Constraint programming (CP) model to show how optimization models could be used in this context. We also present a two phase heuristic to solve this complicated APS problem. While jobs are assigned to the best eligible machines to smooth the workload on the machines in the first phase, a constraint based scheduling heuristic schedules jobs once they are assigned to eligible machines in the second phase. We provide numerical tests and discuss the results for both the model and the heuristic. The concluding remarks and suggestions for future research are stated in the final section of the paper.
This paper explores the contributions of Answer Set programming (ASP) to the study of an established theory from the field of Second Language Acquisition: Input Processing. The theory describes default strategies that...
详细信息
The 31st edition of the International Conference of logicprogramming (ICLP 2015) took place in Cork, Ireland, from 31 August 2015 to 4 September 2015, co-located with the 21st International Conference on Principles a...
The 31st edition of the International Conference of logicprogramming (ICLP 2015) took place in Cork, Ireland, from 31 August 2015 to 4 September 2015, co-located with the 21st International Conference on Principles and practice of Constraint programming (CP 2015) and part of George Boole 200, a celebration of the life and work of George Boole who was born in 1815 and worked at the University College of Cork.
暂无评论