scholarly journals A non-termination criterion for binary constraint logic programs

2009 ◽  
Vol 9 (02) ◽  
pp. 145-164 ◽  
Author(s):  
ÉTIENNE PAYET ◽  
FRED MESNARD
Keyword(s):  
Logic Programming ◽  
Logical Form ◽  
Operational Definition ◽  
Research Topic ◽  
Logic Programs ◽  
Termination Analysis ◽  
Binary Constraint ◽  
Termination Criterion ◽  
Constraint Logic Programs ◽  
The One

AbstractOn the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches, dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary constraint logic programming (CLP) rules, which strictly generalizes our previous works on this subject. We give a generic operational definition and an implemented logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.

MODULARITY AND CORRECTNESS FOR LOGIC PROGRAMS AND KNOWLEDGE BASES

1994 ◽  
Vol 04 (02) ◽  
pp. 257-275
Author(s):  
GRIGORIS ANTONIOU
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Formal Semantics ◽  
Knowledge Bases ◽  
Algebraic Specification ◽  
Equational Logic ◽  
Logic Programs ◽  
Horn Logic ◽  
Large Systems ◽  
The One

A modularity concept for structuring and developing large logic programs and logical knowledge bases is presented. The concept is motivated from work in the field of algebraic specification, and enforces an extreme modularity discipline that goes beyond the one found in imperative or logic programming languages. As concrete programming languages (respectively knowledge representation formalisms), we consider Horn logic and equational logic programming. We give formal semantics for single modules and discuss correctness and verification issues. Large systems are constructed as interconnections of single modules. We introduce the so-called module operations of composition, actualization, and union, and give results concerning compositionality of semantics and correctness preservation.

scholarly journals Performing fully parallel constraint logic programming on a quantum annealer

2018 ◽  
Vol 18 (5-6) ◽  
pp. 928-949 ◽  
Author(s):  
SCOTT PAKIN
Keyword(s):  
Logic Programming ◽  
Constraint Logic Programming ◽  
Logic Programs ◽  
Machine Model ◽  
Computing Systems ◽  
Model Hamiltonian ◽  
Constraint Logic Programs ◽  
Classical Computing ◽  
Specialized Hardware ◽  
High Level

AbstractAquantum annealerexploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially outperforming classical computing systems. However, despite quantum annealers having recently become commercially available, there are relatively few high-level programming models that target these devices. In this article, we show how to compile a subset of Prolog enhanced with support for constraint logic programming into a two-local Ising-model Hamiltonian suitable for execution on a quantum annealer. In particular, we describe the series of transformations one can apply to convert constraint logic programs expressed in Prolog into an executable form that bears virtually no resemblance to a classical machine model yet that evaluates the specified constraints in a fully parallel manner. We evaluate our efforts on a 1,095-qubit D-Wave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.

scholarly journals Non-termination analysis of logic programs with integer arithmetics

2011 ◽  
Vol 11 (4-5) ◽  
pp. 521-536 ◽  
Author(s):  
DEAN VOETS ◽  
DANNY DE SCHREYE
Keyword(s):  
Logic Programming ◽  
Real Life ◽  
Second Phase ◽  
Logic Programs ◽  
Arithmetic Operations ◽  
Termination Analysis ◽  
The Past ◽  
Constraint Problem ◽  
Prolog Programs

AbstractIn the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a non-termination condition for Logic Programs containing integer arithmetics. The analyzer is based on our non-termination analyzer presented at International Logic Programming Conference (ICLP) 2009. The analysis starts from a class of queries and infers a subclass of non-terminating ones. In first phase, we ignore the outcome (success or failure) of the arithmetic operations, assuming success of all arithmetic calls. In second phase, we characterize successful arithmetic calls as a constraint problem, the solution of which determines the non-terminating queries.

scholarly journals Logic programs with monotone abstract constraint atoms

2008 ◽  
Vol 8 (2) ◽  
pp. 167-199 ◽  
Author(s):  
VICTOR W. MAREK ◽  
ILKKA NIEMELÄ ◽  
MIROSŁAW TRUSZCZYŃSKI
Keyword(s):  
Logic Programming ◽  
Logic Programs ◽  
Common Generalization ◽  
One Step ◽  
Normal Logic ◽  
The One ◽  
Operational Concept ◽  
Stable Models

AbstractWe introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the generalization involves nondeterminism. Our main results demonstrate that our formalism is a common generalization of (1) normal logic programming with its semantics of models, supported models and stable models, (2) logic programming with weight atoms lparse programs) with the semantics of stable models, as defined by Niemelä, Simons and Soininen, and (3) of disjunctive logic programming with the possible-model semantics of Sakama and Inoue.

Failure tabled constraint logic programming by interpolation

2013 ◽  
Vol 13 (4-5) ◽  
pp. 593-607 ◽  
Author(s):  
GRAEME GANGE ◽  
JORGE A. NAVAS ◽  
PETER SCHACHTE ◽  
HARALD SØNDERGAARD ◽  
PETER J. STUCKEY
Keyword(s):  
Logic Programming ◽  
Constraint Logic Programming ◽  
Logic Programs ◽  
Execution Strategy ◽  
Speed Up ◽  
Constraint Logic Programs

AbstractWe present a new execution strategy for constraint logic programs calledFailure Tabled CLP. Similarly toTabled CLPour strategy records certain derivations in order to prune further derivations. However, our method only learns fromfailed derivations. This allows us to computeinterpolantsrather thanconstraint projectionfor generation ofreuse 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.

Understanding functional illiteracy from a policy, adult education, and cognition point of view: Towards a joint referent framework

2019 ◽  
Vol 30 (2) ◽  
pp. 109-122
Author(s):  
Aleksandar Bulajić ◽  
Miomir Despotović ◽  
Thomas Lachmann
Keyword(s):  
Adult Education ◽  
Operational Definition ◽  
Literacy Skills ◽  
Point Of View ◽  
Industrialized Countries ◽  
Functional Illiteracy ◽  
Scale Levels ◽  
Components Of Reading ◽  
The One ◽  
Definition Of

Abstract. The article discusses the emergence of a functional literacy construct and the rediscovery of illiteracy in industrialized countries during the second half of the 20th century. It offers a short explanation of how the construct evolved over time. In addition, it explores how functional (il)literacy is conceived differently by research discourses of cognitive and neural studies, on the one hand, and by prescriptive and normative international policy documents and adult education, on the other hand. Furthermore, it analyses how literacy skills surveys such as the Level One Study (leo.) or the PIAAC may help to bridge the gap between cognitive and more practical and educational approaches to literacy, the goal being to place the functional illiteracy (FI) construct within its existing scale levels. It also sheds more light on the way in which FI can be perceived in terms of different cognitive processes and underlying components of reading. By building on the previous work of other authors and previous definitions, the article brings together different views of FI and offers a perspective for a needed operational definition of the concept, which would be an appropriate reference point for future educational, political, and scientific utilization.

A Modal Semantics of Negation in Logic Programming

1992 ◽  
Vol 16 (3-4) ◽  
pp. 231-262
Author(s):  
Philippe Balbiani
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Modal Logics ◽  
Kripke Models ◽  
Logic Programs ◽  
Modal Semantics ◽  
Soundness And Completeness ◽  
Modal Completion ◽  
Well Foundedness

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.

scholarly journals Revision and Conditional Inference for Abstract Dialectical Frameworks

2021 ◽  
Author(s):  
Jesse Heyninck ◽  
Gabriele Kern-Isberner ◽  
Tjitze Rienstra ◽  
Kenneth Skiba ◽  
Matthias Thimm
Keyword(s):  
Belief Revision ◽  
Research Topic ◽  
Conditional Inference ◽  
Ramsey Test ◽  
The One ◽  
Exact Relationship ◽  
Nonmonotonic Inference ◽  
Total Preorder

For propositional beliefs, there are well-established connections between belief revision, defeasible conditionals and nonmonotonic inference. In argumentative contexts, such connections have not yet been investigated. On the one hand, the exact relationship between formal argumentation and nonmonotonic inference relations is a research topic that keeps on eluding researchers despite recently intensified efforts, whereas argumentative revision has been studied in numerous works during recent years. In this paper, we show that similar relationships between belief revision, defeasible conditionals and nonmonotonic inference hold in argumentative contexts as well. We first define revision operators for abstract dialectical frameworks, and use such revision operators to define dynamic conditionals by means of the Ramsey test. We show that such conditionals can be equivalently defined using a total preorder over three-valued interpretations, and study the inferential behaviour of the resulting conditional inference relations.

scholarly journals Learning Large Logic Programs By Going Beyond Entailment

2020 ◽  
Author(s):  
Andrew Cropper ◽  
Sebastijan Dumančic
Keyword(s):  
Logic Programming ◽  
Loss Function ◽  
Inductive Logic Programming ◽  
State Of The Art ◽  
Inductive Logic ◽  
Program Synthesis ◽  
Loss Functions ◽  
Logic Programs ◽  
Binary Decision ◽  
Best First Search

A major challenge in inductive logic programming (ILP) is learning large programs. We argue that a key limitation of existing systems is that they use entailment to guide the hypothesis search. This approach is limited because entailment is a binary decision: a hypothesis either entails an example or does not, and there is no intermediate position. To address this limitation, we go beyond entailment and use 'example-dependent' loss functions to guide the search, where a hypothesis can partially cover an example. We implement our idea in Brute, a new ILP system which uses best-first search, guided by an example-dependent loss function, to incrementally build programs. Our experiments on three diverse program synthesis domains (robot planning, string transformations, and ASCII art), show that Brute can substantially outperform existing ILP systems, both in terms of predictive accuracies and learning times, and can learn programs 20 times larger than state-of-the-art systems.

Sign in / Sign up

Export Citation Format

Share Document