The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic (...) and commonsense reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found (...) in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Doctoral programs at U.S. universities play a critical role in the development of human resources both in the United States and abroad. This volume reports the results of an extensive study of U.S. research-doctorate programs in five broad fields: physical sciences and mathematics, engineering, social and behavioral sciences, biological sciences, and the humanities. Research-Doctorate Programs in the United States documents changes that have taken place in the size, structure, and quality of doctoral education since the widely used 1982 editions. This (...) update provides selected information on nearly 4,000 doctoral programs in 41 subdisciplines at 274 doctorate-granting institutions. This volume also reports the results of the National Survey of Graduate Faculty, which polled a sample of faculty for their views on the scholarly quality of program faculty and the effectiveness of doctoral programs in preparing research scholars/scientists. This much-anticipated update of such an essential reference will be useful to education administrators, university faculty, and students seeking authoritative information on doctoral programs. (shrink)

Gatekeeping, or determining membership of your group, is crucial to science: the moniker ‘scientific’ is a stamp of epistemic quality or even authority. But gatekeeping in science is fraught with dangers. Gatekeepers must exclude bad science, science fraud and pseudoscience, while including the disagreeing viewpoints on which science thrives. This is a difficult tightrope, not least because gatekeeping is a human matter and can be influenced by biases such as groupthink. After spelling out these general tensions around gatekeeping in science, (...) we shed light on them with a case study from psychology. This concerns whether academic psychologists rightly or wrongly classify the applied-psychology framework of NLP (‘neuro-linguistic programming’) as unscientific and even pseudoscientific. This example of gatekeeping is particularly instructive because both the NLP community and the psychology community, we argue, make legitimate but also illegitimate moves. This case gives rise to several general insights about gatekeeping in science more generally. (shrink)

Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result (...) provides a natural semantics for distributed logic programs, including those involving confidence factors. The classical two-valued and the Kripke/Kleene three-valued semantics become special cases, since the logics involved are natural sublogics of Belnap’s logic, the logic given by the simplest bilattice. (shrink)

Thirty-Five Years of Research on Neuro-Linguistic Programming. NLP Research Data Base. State of the Art or Pseudoscientific Decoration? The huge popularity of Neuro-Linguistic Programming therapies and training has not been accompanied by knowledge of the empirical underpinnings of the concept. The article presents the concept of NLP in the light of empirical research in the Neuro-Linguistic Programming Research Data Base. From among 315 articles the author selected 63 studies published in journals from the Master Journal List of (...) ISI. Out of 33 studies, 18.2% show results supporting the tenets of NLP, 54.5% - results non-supportive of the NLP tenets and 27.3% brings uncertain results. The qualitative analysis indicates the greater weight of the non-supportive studies and their greater methodological worth against the ones supporting the tenets. Results contradict the claim of an empirical basis of NLP. (shrink)

Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51 125–157. A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search (...) instructions. The operational semantics is formalized by the identification of a class of cut-free sequent proofs called uniform proofs. A uniform proof is one that can be found by a goal-directed search that respects the interpretation of the logical connectives as search instructions. The concept of a uniform proof is used to define the notion of an abstract logic programming language, and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Horn clauses are then generalized to hereditary Harrop formulas and it is shown that first-order and higher-order versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language significance of the various generalizations to first-order Horn clauses is briefly discussed. (shrink)

One purpose of cognitive diagnostic model is designed to make inferences about unobserved latent classes based on observed item responses. A heuristic for test construction based on the CDM information index proposed by Henson and Douglas has a far-reaching impact, but there are still many shortcomings. He and other researchers had also proposed new methods to improve or overcome the inherent shortcomings of the CDI test assembly method. In this study, one test assembly method of maximizing the minimum inter-class distance (...) is proposed by using mixed-integer linear programming, which aims to overcome the shortcomings that the CDI method is limited to summarize the discriminating power of each item into a single CDI index while neglecting the discriminating power for each pair of latent classes. The simulation results show that compared with the CDI test assembly and random test assembly, the new test assembly method performs well and has the highest accuracy rate in terms of pattern and attributes correct classification rates. Although the accuracy rate of the new method is not very high under item constraints, it is still higher than the CDI test assembly with the same constraints. (shrink)

In this paper, I set out some basic elements of a deontic logic with an implementation appropriate for handling conflicting legal obligations for purposes of programming autonomous machine agents. Kantian justice demands that the prescriptive system of enforceable public laws be consistent, yet statutes or case holdings may often describe legal obligations that contradict; moreover, even fundamental constitutional rights may come into conflict. I argue that a deontic logic of the law should not try to work around such conflicts (...) but, instead, identify and expose them so that the rights and duties that generate inconsistencies in public law can be explicitly qualified and the conflicts resolved. I then argue that a credulous, non-monotonic deontic logic can describe inconsistent legal obligations while meeting Kant’s demand for consistency in the prescriptive system of public law. Finally, I propose an implementation of this logic via a modified form of “answer set programming,” which I demonstrate with some simple examples. (shrink)

"An important contribution to contemporary jurisprudential debate and to legal thought more generally, Just Interpretations is far ahead of currently available work."--Peter Goodrich, author of Oedipus Lex "I was struck repeatedly by the clarity of expression throughout the book. Rosenfeld's description and criticism of the recent work of leading thinkers distinguishes his work within the legal theory genre. Furthermore, his own theory is quite original and provocative."--Aviam Soifer, author of Law and the Company We Keep.

Facebook research has proliferated during recent years. However, since November 2017, Facebook has introduced a new limitation on the maximum amount of page posts retrievable through their Graph application programming interface, while there is limited documentation on how these posts are selected. This paper compares two datasets of the same Facebook page, a full dataset obtained before the introduction of the limitation and a partial dataset obtained after, and employs bootstrapping technique to assess the bias caused by the new (...) limitation. This paper demonstrates that posts with high user engagement, Photo posts and Video posts, are over-represented, while Link posts are under-represented. Top-term analysis reveals that there are significant differences in the most prominent terms between the full and partial dataset. This paper also reverse engineered the new application programming interface’s ranking algorithm to identify the features of a post that would affect its odds of being selected. Sentiment analysis reveals that there are significant differences in the sentiment word usage between the selected and non-selected posts. This paper has significant implications for the representativeness of research that use Facebook page data collected after the introduction of the limitation. (shrink)

In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP). In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi-objective programming problems are transformed into a single objective linear programming problem by using a first order Taylor polynomial series. Finally, to illustrate the efficiency of the proposed method, a numerical experiment for supplier selection is given as an application of Taylor series method for solving neutrosophic (...) multi-objective programming problem at end of this paper. (shrink)

Several congregations in the workspace of the Netherdutch Reformed Church of Africa are losing viability and sustainability. This can be attributed to various factors, the most prominent being isolation. Isolation is defined here as the inability of some congregations to move away from maintenance and an inward focus towards making necessary adjustments on the way to a dimension of missional focus. While commitment and enthusiasm are present in the work of all congregations, some find it difficult to adapt their established (...) ideas and in some cases obsolete customs and traditions. Other congregations have made the necessary adjustments by defining themselves as missional. In congregations where constructive change occurs, the focus moves to undertake congregational ministries. The congregation not only gains insight into their own situation but also becomes aware of God’s calling for that specific congregation within a specific context. The focus shifts from their own situation and needs to the needs and challenges of the context surrounding the specific congregation. A consequence of this change in focus is that the whole ministry of the congregation adjusts accordingly. These congregations discover their own unique spirituality and begin to ask: For whom do we exist? The article is based on a PhD thesis, where Osmer’s four questions of practical theology were brought into the conversation with the modelling process of neuro-linguistic programming, in an attempt to sojourn with congregations towards a contextual missional focus. This research was undertaken to expand Osmer’s four questions of practical theology by using the modelling process of neuro-linguistic programming so that congregations may succeed in making the necessary adjustments. (shrink)

This paper studies the problems of tip position regulation and vibration suppression of flexible manipulators without using the model. Because of the two-timescale characteristics of flexible manipulators, applying the existing model-free control methods may lead to ill-conditioned numerical problems. In this paper, the dynamics of a flexible manipulator is decomposed into two subsystems which are linear and controllable at different timescales by singular perturbation theory and a model-free composite controller is designed to alleviate the ill-conditioned numerical problems. To do this, (...) a model-free composite control strategy is constructed which facilitates in designing the controller in slow and fast timescales. In the slow timescale, the slow subsystem controller is designed by adaptive dynamic programming based on the measurements of the slow inputs and the position, while the vibration in the slow timescale is estimated by the least square method. In the fast timescale, the vibration is reconstructed based on the measurements of vibration and its estimate in the slow timescale, by which the fast controller is designed using ADP. Stability of the closed-loop system is proved by SP theory. Finally, simulations are given to show the feasibility and effectiveness of the proposed methods. (shrink)

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics. it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

This volume presents a collection of refereed papers reflecting the state of the art in the area of over-constrained systems. Besides 11 revised full papers, selected from the 24 submissions to the OCS workshop held in conjunction with the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Marseilles in September 1995, the book includes three comprehensive background papers of central importance for the workshop papers and the whole field. Also included is an introduction (...) by one of the volume editors together with a bibliography listing 243 entries. All in all this is a very useful reference book relevant for all researchers and practitioners interested in hierarchical, partial, and over-constrained systems. (shrink)

Purpose: This study aimed to explore the relationship between mathematic achievement and programming self-efficacy, and adopt a mediation model to verify the mediating role of creativity on the relationship between mathematic achievement and programming self-efficacy.Methods: A total of 950 upper-secondary school students were surveyed using their math test scores, the Kirton Adaption-Innovation and the Programmed Self-Efficacy Scale. SPSS-26 was used for descriptive statistical analysis and correlation analysis of related variables. The PROCESS plugin was used to test the mediating (...) effect of creativity.Results: Mathematic achievement has a positive effect on programming self-efficacy, mathematic achievement is positively related to creativity, and creativity also has a positive influence on programming self-efficacy. Creativity has a mediating effect on the relationship between mathematic achievement and programming self-efficacy.Conclusion: The results revealed that mathematic achievement affected programming self-efficacy directly and also indirectly through creativity. This provided certain ideas for the development of programming education for teenagers. Since students’ mathematics learning and creativity are related to programming learning, it is necessary to pay attention to the integration of the disciplines of programming education and mathematics. Further, the cultivation of innovative thinking is also critical to facilitate programming learning. (shrink)

Flipped learning could improve the learning effectiveness of students. However, some studies have pointed out the limitations related to flipped classrooms because the content of the flipped course does not vary according to the needs of the students. On the other hand, adaptive teaching, which customizes the learning mode according to the individual needs of students, can make up for some of the shortcomings of flipped teaching. This study combines adaptive teaching with flipped teaching and applies it to face-to-face classroom (...) activities. The purpose of this research is to explore whether the implementation of flipping and adaptive learning in a computer programming course can improve the learning effectiveness of students. The experimental subjects of this study are the sophomore students in the Department of Information Management. The flipped classroom with adaptive instruction has been realized in the limited course time. This study uses questionnaires to collect pre- and post-test data on the “learning motivation” of students. The learning effectiveness was evaluated based on the students' previous programming course and the semester scores of this course. Research results show that the post-test “learning motivation” has improved overall compared with the pre-test, and the learning effect is significant. The results of this research not only prove the effectiveness of modern teaching theories in programming courses but also lay the foundation for future teaching design. (shrink)

The Lisp programming language is often described as the first functional programming language and also as an important early AI language. In the history of functional programming, however, it occupies a rather anomalous position, as the circumstances of its development do not fit well with the widely accepted view that functional languages have been developed through a theoretically-inspired project of deriving practical programming languages from the lambda calculus. This paper examines the origins of Lisp in the (...) early AI programming work of the mid-to-late 1950s, and in particular in the work of Allen Newell, Cliff Shaw and Herbert Simon. Their 1956 program, the Logic Theory Machine, introduced new ideas about data and program structures that were articulated in response to perceived limitations in existing programming technique. Later writers, notably John Backus, have described these features as constituting a “programming language style” distinct from the traditional style that preceded it. The paper examines the origins of the earlier style in practices of manual computation, analyses the key technical differences between it and the style first manifested in the Logic Theory Machine, and concludes that programming practice and experience play a large and underappreciated role in the development of programming styles and languages. (shrink)

In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the mean- ing of counting and choice by reducing these constructs to first-order formulas. For the new language, the concept of a safe program is defined, and its semantic role is investigated. (...) We compare the new language with the concept of a disjunc- tive program with aggregates introduced by Faber, Leone and Pfeifer, and discuss the possibility of implementing a frag- ment of the language by translating it into the input language of the answer set solver DLV. The language is also compared with cardinality constraint programs defined by Syrjänen. (shrink)

It is a mystery how we just know to be in any context of our lives. It happens without our thinking. By this same token we never have to work out how to speak an English sentence that we utter. We just know to talk and do. This paper is an exploration of this mystery.

The revolution in science and technology is significantly changing the character of production and work. One of the important aspects of this change is that labor becomes a scientifically organized process that makes increased demands on development of the human factor in production. The most productive scientific ideas, the most perfect technologies, when combined with production, may fail to produce the desired "yield" unless a sufficient number of well-trained personnel, or of the required organizational structures corresponding to the level of (...) societal relationships, the habits of collective work, and human psychology, are available. Implementation of a truly scientific organization of work presumes as a condition that a considerable level of development will already have been achieved in socialist labor discipline, as well as habits of collectivism and ethical motivations for work, and not merely occupational skills and qualities. More precisely, the list of qualities that, while they may not be occupational in the strict sense are nonetheless necessary features of the person employed in socialist society, includes general cultural and moral development, social activity, and political consciousness. The transformation of work into a scientifically organized process presumes an increasing demand for a highly skilled labor force with comprehensive development. Moreover, the development of the labor force and the rise in its skills should run ahead of the development of the means of production. It is precisely this that determines the need for conscious management of the development of the human being. For comprehensive development of the labor force to run ahead of the means of production requires considerable outlays for occupational and general cultural training of the direct participants in production. A worker of a new type, with a higher level of general and occupational education, will emerge in the course of implementation of a complex of economic, social, and scientific-technological measures. (shrink)

The search for symmetry is part of the fundamental scientific paradigm in mathematics and physics. Can this be valid also for economics? This book represents an attempt to explore this possibility. The behavior of price-taking producers, monopolists, monopsonists, sectoral market equilibria, behavior under risk and uncertainty, and two-person zero- and non-zero-sum games are analyzed and discussed under the unifying structure called the linear complementarity problem. Furthermore, the equilibrium problem allows for the relaxation of often-stated but unnecessary assumptions. This unifying approach (...) offers the advantage of a better understanding of the structure of economic models. It also introduces the simplest and most elegant algorithm for solving a wide class of problems. (shrink)

This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.