the proceedings of the internationalconference on logicprogramming (iclp) have had several publishers, including MIT Press and Springer\'s Lecture Notes in Computer Science. Beginning in 2010, the proceedings ha...
详细信息
the proceedings of the internationalconference on logicprogramming (iclp) have had several publishers, including MIT Press and Springer\'s Lecture Notes in Computer Science. Beginning in 2010, the proceedings have been published in a dual format: with regular papers contained in a special issue of theory and Practice of logicprogramming (TPLP), and technical communications as a Dagstuhl LIPics series publication. the reason for the change was that compared to researchers in other fields, computer scientists publish more in conferences or symposia and less in journals. the thinking went that since many iclp papers are of journal quality - or nearly so - why not publish them in a journal straight away? And why not TPLP?
the proceedings contain 11 papers. the special focus in this conference is on Inductive logicprogramming. the topics include: Weight Your Words: the Effect of Different Weighting Schemes on Wordification Performance;...
ISBN:
(纸本)9783030492090
the proceedings contain 11 papers. the special focus in this conference is on Inductive logicprogramming. the topics include: Weight Your Words: the Effect of Different Weighting Schemes on Wordification Performance;learning Probabilistic logic Programs over Continuous Data;towards Meta-interpretive Learning of programming Language Semantics;Towards an ILP Application in Machine Ethics;on the Relation Between Loss Functions and T-Norms;rapid Restart Hill Climbing for Learning Description logic Concepts;neural Networks for Relational Data;learning logic Programs from Noisy State Transition Data;a New Algorithm for Computing Least Generalization of a Set of Atoms.
System-on-chip (SoC) design requires complex reasoning about the interactions between an architectural specification, the microarchitectural datapath (e.g., functional units), and the control logic (which coordinates ...
ISBN:
(纸本)9798400703911
System-on-chip (SoC) design requires complex reasoning about the interactions between an architectural specification, the microarchitectural datapath (e.g., functional units), and the control logic (which coordinates the datapath) to facilitate the critical computing tasks on which we all depend. Hardware specialization is now the expectation rather than the exception, meaning we need new hardware design tools to bring ideas to reality with both agility and *** introduce a new technique, "control logic synthesis", which automatically generates control logic given a datapath description and an architectural specification. this enables an entirely new hardware design process where the designer only needs to write a datapath sketch, leaving the control logic as "holes." then, guided by an architectural specification, we adapt program synthesis techniques to automatically generate a correct hardware implementation of the control logic, filling the holes and completing the *** evaluate control logic synthesis over two classes of control (state machines and instruction decoders) and different architectures (embedded-class RISC-V cores and hardware accelerators for cryptography). We demonstrate how agile-oriented SoC developers can iterate over designs without writing control logic by hand yet still retain formal assurances with only minimal microarchitectural information.
the proceedings contain 7 papers. the topics discussed include: care robots learning rules of ethical behavior under the supervision of an ethical teacher;a parallelization approach for hybrid-AI-based models: an appl...
the proceedings contain 7 papers. the topics discussed include: care robots learning rules of ethical behavior under the supervision of an ethical teacher;a parallelization approach for hybrid-AI-based models: an application study for semantic segmentation of medical images;towards inductive learning of domain-specific heuristics for ASP;mining sequences in phone recordings with answer set programming;estimation-based verification of cyber-physical systems via statistical model checking;explainability via short formulas: the case of propositional logic with implementation;and evaluating epistemic logic programs via answer set programming with quantifiers.
the links to the online only Technical Communications in Lamma and Swift (2013) are unfortunately broken. All of the Technical Communications can be found here: https://***/core/journals/theory-and-practice-of-logic-p...
the links to the online only Technical Communications in Lamma and Swift (2013) are unfortunately broken. All of the Technical Communications can be found here: https://***/core/journals/theory-and-practice-of-logic-programming/article/editorial-29th-international-conference-on-logic-programming-special-issue/82FDD81073DC30A563ED242516CADAAE#fndtn-supplementary-materials
Recent years have witnessed an increasing interest in enhancing answer set solvers by allowing function symbols. Since the introduction of function symbols makes common inference tasks undecidable, research has focuse...
详细信息
Recent years have witnessed an increasing interest in enhancing answer set solvers by allowing function symbols. Since the introduction of function symbols makes common inference tasks undecidable, research has focused on identifying classes of programs allowing only a restricted use of function symbols while ensuring decidability of common inference tasks. Finitely-ground programs, introduced in Calimeri et al. (2008), are guaranteed to admit a finite number of stable models with each of them of finite size. Stable models of such programs can be computed and thus common inference tasks become decidable. Unfortunately, checking whether a program is finitely-ground is semi-decidable. this has led to several decidable criteria, called termination criteria, providing sufficient conditions for a program to be finitely-ground. this paper presents a new technique that, used in conjunction with current termination criteria, allows us to detect more programs as finitely-ground. Specifically, the proposed technique takes a logic program P and transforms it into an adorned program P-mu withthe aim of applying termination criteria to P-mu rather than P. the transformation is sound in that if the adorned program satisfies a certain termination criterion, then the original program is finitely-ground. Importantly, applying termination criteria to adorned programs rather than the original ones strictly enlarges the class of programs recognized as finitely-ground.
Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FAS...
详细信息
Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. these approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answer sets are between these bounds. this paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. the operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answer sets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool.
the paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints. the framework allows to capture expressive fluent a...
the paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints. the framework allows to capture expressive fluent annotations as well as data awareness in a uniform way. It allows for a declarative specification of a business process but also for encoding processes specified in conventional workflow languages. Verification of temporal properties of a business process, including verification of compliance to business rules, is performed by bounded model checking techniques in Answer Set programming, extended with constraint solving for dealing with conditions on numeric data.
We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method ...
We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. this allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.
暂无评论