the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic l...
ISBN:
(纸本)364213839X
the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic logicprogramming based on the distribution semantics;induction of relational algebra expressions;a logic-based approach to relation extraction from texts;discovering rules by meta-level abduction;inductive generalization of analytically learned goal hierarchies;nonmonotonic onto-relational learning;cp-logictheory inference with contextual variable elimination and comparison to BDD based inference methods;speeding up inference in statistical relational learning by clustering similar query literals;an inductivelogicprogramming approach to validate hexose binding biochemical knowledge;boosting first-order clauses for large, skewed data sets;and transfer learning via relational templates.
inductive definitions are ubiquitous in mathematics and computer science, and play an important role in knowledge representation. To date, several proof systems have been developed for inductive definitions. However, ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
inductive definitions are ubiquitous in mathematics and computer science, and play an important role in knowledge representation. To date, several proof systems have been developed for inductive definitions. However, these systems are typically limited to stratified definitions, while many important definitions are not stratified. Inspired by logicprogramming, the logic FO(ID) has been developed as an extension of classical first-order logic with general inductive definitions that go beyond stratification. this paper presents a classical sequent calculus LFO(ID) for FO(ID), based on the sequent calculus LKID by Brotherston and Simpson, which formalizes the principle of mathematical induction. While syntactically remaining close to LKID, LFO(ID) covers a substantially larger class of inductive definitions. the soundness of LFO(ID) is proven, thereby showing that a relatively conservative adaptation of LKID is capable of handling the liberal forms of definitions in FO(ID), governed by the intricate well-founded semantics.
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Proces...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Process Mining, thanks to their formal semantics that enables automated analysis techniques. In this context, model repair is the task of aligning a process model with actual executions of the process. Current solutions to model repair do not allow for embedding domain knowledge, providing guarantees of rigor, and enforcing structural requirements at the same time. In this paper, we fill this gap by proposing an approach based on the inductivelogicprogramming system ILASP. We then implement our approach and perform an experimental evaluation, showing both its expressiveness and feasibility.
the proceedings contain 19 papers. the special focus in this conference is on inductivelogicprogramming. the topics include: A Simulated Annealing Meta-heuristic for Concept Learning in Description logics;generative...
ISBN:
(纸本)9783030974534
the proceedings contain 19 papers. the special focus in this conference is on inductivelogicprogramming. the topics include: A Simulated Annealing Meta-heuristic for Concept Learning in Description logics;generative Clausal Networks: Relational Decision Trees as Probabilistic Circuits;human-Like Rule Learning from Images Using One-Shot Hypothesis Derivation;learning and Revising Dynamic Temporal theories in the Full Discrete Event Calculus;learning logic Programs Using Neural Networks by Exploiting Symbolic Invariance;feature Learning by Least Generalization;a First Step Towards Even More Sparse Encodings of Probability Distributions;mapping Across Relational Domains for Transfer Learning with Word Embeddings-Based Similarity;programmatic Policy Extraction by Iterative Local Search;online Learning of logic Based Neural Network Structures;embedding Models for Knowledge Graphs Induced by Clusters of Relations and Background Knowledge;using Domain-Knowledge to Assist Lead Discovery in Early-Stage Drug Design;preface;non-parametric Learning of Embeddings for Relational Data Using Gaifman Locality theorem;transfer Learning for Boosted Relational Dependency Networks through Genetic Algorithm;Ontology Graph Embeddings and ILP for Financial Forecasting;synthetic Datasets and Evaluation Tools for inductive Neural Reasoning.
the semantics of logics is based on valuations that map variables to values, while programming languages cannot store complex values atomically. they have a pointer semantics where complex data is stored on the heap, ...
详细信息
ISBN:
(纸本)9783031765537;9783031765544
the semantics of logics is based on valuations that map variables to values, while programming languages cannot store complex values atomically. they have a pointer semantics where complex data is stored on the heap, linked with pointers. the standard approach to bridge the semantic gap between algebraic specifications and executable programs is to translate algebraic data types, recursive definitions and programs to functional code with immutable data types. Since functional programs are often less efficient than C programs due to the lack (or limited use) of mutation and the requirement of using garbage collection, we develop a different approach in this paper that is based on always mutating data structures but keeping different ones disjoint. the approach generates efficient C programs from the specifications, which have a pointer semantics and explicitly allocate and free memory on the heap. Formal specifications are given for the semantics of a core source and target language that allow to demonstrate the main transformations necessary and prove their correctness. the approach has been implemented for the full language and produces working C code.
the proceedings contain 50 papers. the special focus in this conference is on logicprogramming. the topics include: Achieving type safety for low-level code;logic information systems for logic programmers;a logic pro...
ISBN:
(纸本)3540206426
the proceedings contain 50 papers. the special focus in this conference is on logicprogramming. the topics include: Achieving type safety for low-level code;logic information systems for logic programmers;a logicprogramming view of authorization in distributed systems;compositional verification of infinite state systems;a constraint-based approach to structure prediction for simplified protein models that outperforms other existing methods;concurrency, time, and constraints;symbolic model-checking for biochemical systems;component-based software development and logicprogramming;a tutorial on proof theoretic foundations of logicprogramming;handling existential derived predicates in view updating;efficient evaluation of logic programs for querying data integration systems;argumentation databases;order and negation as failure;computing minimal models, stable models, and answer sets;uniform equivalence of logic programs under the stable model semantics;answer set programming phase transition;termination analysis with types is more accurate;a propagation tracer for gnu-prolog;implementing constraint propagation by composition of reductions;forward versus backward verification of logic programs;native preemptive threads in SWI-prolog;declarative concurrency for java and on the complexity of dependent and-parallelism in logicprogramming.
the proceedings contain 21 papers. the special focus in this conference is on Invited Talks, Languages, Answer-Set programming and Abductive Reasoning, Semantics, Constraints and logicprogramming, Answer-Set Programm...
ISBN:
(纸本)9783642415234
the proceedings contain 21 papers. the special focus in this conference is on Invited Talks, Languages, Answer-Set programming and Abductive Reasoning, Semantics, Constraints and logicprogramming, Answer-Set programming and Model Expansion and WLP System Descriptions. the topics include: the IMPL policy language for managing inconsistency in multi-context systems;the parameterized complexity of constraint satisfaction and reasoning;translating nondeterministic functional language based on attribute grammars into java;sensitivity analysis for declarative relational query languages with ordinal ranks;a uniform fixpoint approach to the implementation of inference methods for deductive databases;translating answer-set programs into bit-vector logic;making use of advances in answer-set programming for abstract argumentation systems;confidentiality-preserving publishing of EDPs for credulous and skeptical users;every formula-based logic program has a least infinite-valued model;descriptive approach to preferred answer sets;solving modular model expansion: case studies;a constraint-based interactive product configurator;HEX-programs with nested program calls;a prototype of a knowledge-based programming environment;an IDE for answer-set programming-preliminary report;a system for visualising and visual editing of interpretations for answer-set programsa and unit testing in ASPIDE.
the proceedings contain 52 papers. the topics discussed include: an algorithm for enumerating maximal models of horn theories with an application to modal logics;may-happen-in-parallel analysis for priority-based sche...
ISBN:
(纸本)9783642452208
the proceedings contain 52 papers. the topics discussed include: an algorithm for enumerating maximal models of horn theories with an application to modal logics;may-happen-in-parallel analysis for priority-based scheduling;a semantic basis for proof queries and transformations;expressive path queries on graphs with data;dynamic and static symmetry breaking in answer set programming;resourceful reachability as HORN-LA;comparison of LTL to deterministic Rabin automata translators;towards rational closure for fuzzy logic: the case of propositional Gödel logic;multi-objective discounted reward verification in graphs and MDPs;complexity analysis in presence of control operators and higher-order functions;Zenon Modulo: when Achilles outruns the tortoise using deduction modulo;long-distance resolution: proof generation and strategy extraction in search-based QBF solving;and a proof of strong normalisation of the typed atomic lambda-calculus.
When solving a job scheduling problem that involves humans, the times in which they are available must be taken into account. For practical acceptance of a scheduling tool, it is further crucial that the interaction&#...
详细信息
暂无评论