the proceedings contain 29 papers. the special focus in this conference is on Integration of Constraint programming, Artificial Intelligence, and Operations Research. the topics include: the Traveling Social Golfer Pr...
ISBN:
(纸本)9783030782290
the proceedings contain 29 papers. the special focus in this conference is on Integration of Constraint programming, Artificial Intelligence, and Operations Research. the topics include: the Traveling Social Golfer Problem: the Case of the Volleyball Nations League;Towards a Compact SAT-Based Encoding of Itemset Mining Tasks;a Pipe Routing Hybrid Approach Based on A-Star Search and Linear programming;MDDs Boost Equation Solving on Discrete Dynamical Systems;two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors;Improving the Filtering of Branch-and-Bound MDD Solver;on the Usefulness of Linear Modular Arithmetic in Constraint programming;injecting Domain Knowledge in Neural Networks: A Controlled Experiment on a Constrained Problem;learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems;between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations;a Computational Study of Constraint programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects;logic-Based Benders Decomposition for an Inter-modal Transportation Problem;checking Constraint Satisfaction;finding Subgraphs with Side Constraints;Short-Term Scheduling of Production Fleets in Underground Mines Using CP-Based LNS;learning to Reduce State-Expanded Networks for Multi-activity Shift Scheduling;seaPearl: A Constraint programming Solver Guided by Reinforcement Learning;learning to Sparsify Travelling Salesman Problem Instances;optimized Item Selection to Boost Exploration for Recommender Systems;improving Branch-and-Bound Using Decision Diagrams and Reinforcement Learning;physician Scheduling During a Pandemic;strengthening of Feasibility Cuts in logic-Based Benders Decomposition;learning Variable Activity Initialisation for Lazy Clause Generation Solvers;a * -Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem;Partitioning Students into Cohorts During
DeepProbLog is a neural-symbolic framework that integrates probabilistic logicprogramming and neural networks. It is realized by providing an interface between the probabilistic logic and the neural networks. Inferen...
详细信息
this book constitutes the refereed conference proceedings of the 18thinternationalconference on Principles and Practice of Constraint programming (CP 2013), held in Uppsala, Sweden, in September 2013. the 61 revised...
详细信息
ISBN:
(数字)9783642406270
ISBN:
(纸本)9783642406263
this book constitutes the refereed conference proceedings of the 18thinternationalconference on Principles and Practice of Constraint programming (CP 2013), held in Uppsala, Sweden, in September 2013. the 61 revised papers presented together with 3 invited talks were carefully selected from 138 submissions. the scope of the conference is on all aspects of computing with constraints, including: theory, algorithms, environments, languages, models and systems, applications such as decision making, resource allocation, and agreement technologies.
In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. the behavior of the consistency to be learned is taken as the set o...
详细信息
In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. the behavior of the consistency to be learned is taken as the set of examples on which the learning process is applied. the best possible expression of this operator in a given language is then searched. We instantiate this framework to the learning of bound-consistency in the indexical language of Gnu-Prolog.
Lax logic is obtained from intuitionistic logic by adding a single modality ◦ which captures properties of necessity and possibility. this modality was considered by Curry in two papers from 1952 and 1957 and rediscov...
详细信息
Numerous programming models have been introduced to allow programmers to utilize new accelerator-based architectures. While OpenCL and CUDA provide low-level access to accelerator programming, the task cries out for a...
详细信息
ISBN:
(纸本)9783642328206
Numerous programming models have been introduced to allow programmers to utilize new accelerator-based architectures. While OpenCL and CUDA provide low-level access to accelerator programming, the task cries out for a higher-level abstraction. Of the higher-level programming models which have emerged, few are intended to co-exist with mainstream, general-purpose languages while supporting tunability, composability, and transparency of implementation. In this paper, we propose extensions to the type systems (implementable as syntactically neutral annotations) of traditional, general-purpose languages can be made which allow programmers to work at a higher level of abstraction with respect to memory, deferring much of the tedium of data management and movement code to an automatic code generation tool. Furthermore, our technique, based on formal term rewriting, allows for user-defined reduction rules to optimize low-level operations and exploit domain-and/or application-specific knowledge.
We describe how the Davis-Putnam-Logemann-Loveland procedure DPLL is bisimilar to the goal-directed proof-search mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure desc...
详细信息
Rule-based systems are a promising means to specify interface standards for artificial intelligence tools and modules for games, as advocated by the international Came Developers Association. Rules, however, can be to...
详细信息
ISBN:
(纸本)3540454624
Rule-based systems are a promising means to specify interface standards for artificial intelligence tools and modules for games, as advocated by the international Came Developers Association. Rules, however, can be too flexible, allowing undisciplined and "dirty" programming styles and solutions. We advocate in this paper that although rules are a good starting point towards standardising artificial intelligence techniques in games, they must be complemented with automatically verifiable rule schemata to ensure the appropriate implementation of such techniques and theories. We illustrate our point with a specific rule-based implementation of a theory of norms for synthetic characters which enables the specification of sophisticated behaviours.
the proceedings contain 40 papers. the special focus in this conference is on Description logics, Semantic Web, Proof-Carrying Code, Compiler Verification, Non-classical logics and System Descriptions. the topics incl...
ISBN:
(纸本)3540439315
the proceedings contain 40 papers. the special focus in this conference is on Description logics, Semantic Web, Proof-Carrying Code, Compiler Verification, Non-classical logics and System Descriptions. the topics include: Reasoning with expressive description logics;temporal logic for proof-carrying code;formal verification of a java compiler in Isabelle;embedding lax logic into intuitionistic logic;combining proof-search and counter-model construction for deciding godel-dummett logic;connection-based proof search in propositional bi logic;a library for solving quantified difference inequalities;an lcf-style interface between HOL and first-order logic;the math web software bus for distributed mathematical reasoning;testing satisfiability of CNF formulas by computing a stable set of points;a sat based approach for solving formulas over Boolean and linear mathematical propositions;deductive search for errors in free data type specifications using model generation;reasoning by symmetry and function ordering in finite model generation;algorithmic aspects of herbrand models represented by ground atoms with ground equations;a new clausal class decidable by hyperresolution;the hr program for theorem generation;the quest for efficient Boolean satisfiability solvers;recursive path orderings can be context-sensitive;formal verification of a combination decision procedure;a study in meta-theoretic reasoning;faster proof checking in the Edinburgh logical framework;solving for set variables in higher-order theorem proving;lazy theorem proving for bounded model checking over infinite domains and focussing proof-net construction as a middleware paradigm.
this book constitutes the proceedings of the 18thinternationalconference on Quantitative Evaluation Systems, QEST 2021, held in Paris, France, in August 2021.
ISBN:
(数字)9783030851729
ISBN:
(纸本)9783030851712
this book constitutes the proceedings of the 18thinternationalconference on Quantitative Evaluation Systems, QEST 2021, held in Paris, France, in August 2021.
暂无评论