Titlebook: Declarative Programming and Knowledge Management; Conference on Declar Dietmar Seipel,Michael Hanus,Salvador Abreu Conference proceedings 2

white-matter

Techniques for Efficient Lazy-Grounding ASP Solvinge the ASP program to be variable-free, they thus ground the program upfront at the cost of a potential exponential explosion of the space required. Lazy-grounding, where solving and grounding are interleaved, circumvents this grounding bottleneck, but the resulting solvers lack many important search

SEMI

The Syllogistic Reasoning Task: Reasoning Principles and Heuristic Strategies in Modeling Human Clusicipants’ answers systematically deviate from the classical logically correct answers. Recently, a new computational logic approach to modeling human syllogistic reasoning has been developed which seems to perform better than other state-of-the-art cognitive theories. We take this approach as starti

財(cái)政

Concolic Testing of Functional Logic Programseasing popularity. Concolic testing tools are initialized with expressions on concrete input data. But instead of just evaluating them, they additionally collect symbolic information along specific execution paths. This information can be used to systematically compute alternative inputs exploring y

FLEET

Declarative XML Schema Validation with SWI–Prologlarative, currently available tools for . validation are not. In this paper we introduce an implementation of an . validator in .–Prolog, made publicly available as the package?.. Our approach is based on flattening the . and . documents into Prolog facts. The top–down validation makes great use of

acrophobia

plspec – A Specification Language for Prolog Dataype or mode are often made implicitly, without being directly represented in the source code. This complicates identifying the types or data structures anticipated by predicates. In consequence, Covington et?al. proposed that Prolog developers should implement their own runtime type checking system.

inspired

0302-9743 ge Management, INAP 2017, the 31st Workshop on Logic Programming, WLP 2017, and the 25th Workshop on Functional and (Constraint) Logic Programming, WFLP 2017. The 12 full papers presented in this volume were carefully reviewed and selected from 26 submissions. The contributions were organized in top

ATOPY

STERN

Demokratie als teleologisches Prinzips as well as models and patterns captured therein. Here, . helps to include guiding knowledge structures into the process, while . provides interpretability, transparency, and explainability. This paper provides an overview of the key points and important developments in these areas, and outlines future potential and challenges.

Esalate

https://doi.org/10.1007/978-3-322-92248-9syllogistic reasoning has been developed which seems to perform better than other state-of-the-art cognitive theories. We take this approach as starting point, yet instead of trying to model . human reasoner, we aim at identifying clusters of reasoners, which can be characterized by reasoning principles or by heuristic strategies.

是突襲

Implementation of Logical Retraction in Constraint Handling Rules with Justifications of the transformation. We discuss its worst-case time complexity in general. Then we perform experiments. We benchmark the dynamic problem of maintaining shortest paths under addition and retraction of paths. The results validate our complexity considerations.