Roger Vergauwen seeks to provide an answer to the question, "How does language connect to the world?" He begins with the recent developments in formal semantics and from them constructs his own 'theory of reference' with which he considers the nature of the correspondence of the world. The author locates his metalogics between the philosophy of language and epistemology while he covers a range of models from Plato to Wittgenstein. Vergauwen assumes no previous technical or logical study. Contents: Introduction: The (...) Temperature of a Hot Topic; The Tarski Program: Hijacking the Truth about Reference; Reference and Theory of Reference; Inside Out: Reference and Metalogic; Outline of a Logic with Non-Standard Meanings. (shrink)

In the paper, Jan Łukasiewicz’s program of the logicization of philosophy is presented and discussed. Łukasiewicz, known mostly for his invention of trivalent logic as well as his achievements in propositional calculus and metalogic, had always been concerned with the methodological condition of philosophy. He finally found “the measure of exactness” in mathematical logic. According to him, only the use of logical tools may provide philosophical investigations with an appropriate level of exactness. He expressed his views most firmly and (...) directly in the paper, “A call for the method of Philosophy”. Łukasiewicz proposed giving philosophical theories the form of axiomatic systems by indicating the primitive terms of their language, selecting suitable axioms, and explicitly determining the applied rules of inference. All the theses of these systems should be consequences of the accepted axioms and confronted with the data of experience and the results of science. Łukasiewicz’s program is presented together with its inspirations and prospects. (shrink)

A representation methodology for knowledge allowing multiple interpretations is described. It is based on the following conception of legal knowledge and its open texture. Since indeterminate, legal knowledge must be adapted to fit the circumstances of the cases to which it is applied. Whether a certain adaptation is lawful or not is measured by metaknowledge. But as this too is indeterminate, its adaptation to the case must be measured by metametaknowledge, etc. This hierarchical model of law is quite well-established and (...) may serve well as a basis for a legal knowledge system. To account for the indeterminacy of law such a system should support the construction of different arguments for and against various interpretations of legal sources. However, automatizing this reasoning fully is unsound since it would imply a restriction to arguments defending interpretations anticipated at programming time. Therefore, the system must be interactive and the user''s knowledge be furnished in a principled way. Contrary to the widespread opinion that classical logic is inadequate for representing open-textured knowledge, the framework outlined herein is given a formalization in first order logic. (shrink)

Ajdukiewicz called his article Problemat idealizmu transcendentalnego w sformułowaniu semantycznym [The Semantic Version of Transcendental Idealism], published in “Przegląd Filozoficzny” in 1937, a “turning point” of his philosophical development. The aim of the paper is to present various aspects of this turn. Firstly, the historical and philosophical background of the 1937 paper is sketched. It includes the metaphilosophical position of the Lvov‑Warsaw School, and the development of methods applied in this group. Secondly, Ajdukiewicz’s ideas up to 1937 are outlined in (...) order to present what the semantic turn consisted in. Next, the program of the semantic theory of knowledge is sketched, and the steps of Ajdukiewicz’s argumentation against transcendental idealism, with an emphasis on the use of metalogical and semantic results, are presented. Finally, Ajdukiewicz’s proposal is discussed from the methodological point of view. (shrink)

In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...) in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (shrink)

This dissertation examines several of the problems that Hilbert discovered in the foundations of mathematics, from a metalogical perspective. The problems manifest themselves in four different aspects of Hilbert’s views: (i) Hilbert’s axiomatic approach to the foundations of mathematics; (ii) His response to criticisms of set theory; (iii) His response to intuitionist criticisms of classical mathematics; (iv) Hilbert’s contribution to the specification of the role of logical inference in mathematical reasoning. This dissertation argues that Hilbert’s axiomatic approach was guided primarily (...) by model theoretical concerns. Accordingly, the ultimate aim of his consistency program was to prove the model-theoretical consistency of mathematical theories. It turns out that for the purpose of carrying out such consistency proofs, a suitable modification of the ordinary first-order logic is needed. To effect this modification, independence-friendly logic is needed as the appropriate conceptual framework. It is then shown how the model theoretical consistency of arithmetic can be proved by using IF logic as its basic logic. Hilbert’s other problems, manifesting themselves as aspects (ii), (iii), and (iv)—most notably the problem of the status of the axiom of choice, the problem of the role of the law of excluded middle, and the problem of giving an elementary account of quantification—can likewise be approached by using the resources of IF logic. It is shown that by means of IF logic one can carry out Hilbertian solutions to all these problems. The two major results concerning aspects (ii), (iii) and (iv) are the following: (a) The axiom of choice is a logical principle; (b) The law of excluded middle divides metamathematical methods into elementary and non-elementary ones. It is argued that these results show that IF logic helps to vindicate Hilbert’s nominalist philosophy of mathematics. On the basis of an elementary approach to logic, which enriches the expressive resources of ordinary first-order logic, this dissertation shows how the different problems that Hilbert discovered in the foundations of mathematics can be solved. (shrink)

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)

American distance running legend Steve Prefontaine – ‘Pre’ – claimed that he was an artist and that his races were works of art. In this article, I examine and defend Pre’s claims. Using Robert Stecker’s definition of art as a guide, I argue that a race can be a work of art – specifically, performance art. I then argue that Pre’s 3,000 m American record race at the 1972 Bislett Games in Oslo, Norway, and his 5,000 m final at the (...) 1972 Munich Olympics illustrate his view of himself as an artist and are works of art in Stecker’s sense of achieving excellence in fulfilling an artistic function. (shrink)

Argumentation represents a way of reasoning over a knowledge base containing possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a reasoning mechanism, the way an argumentation reasoning engine reaches these conclusions resembles the cognitive process that humans follow to analyze their beliefs; thus, unlike other computationally reasoning systems, argumentation offers an intellectually friendly alternative to other defeasible reasoning systems. LogicProgrammingisacomputationalparadigmthathasproducedcompu- tationallyattractivesystemswithremarkablesuccessinmanyapplications. Merging ideas from both areas, Defeasible Logic Programming offers a computational reasoning system that uses an argumentation (...) engine to obtain answers from a knowledge base represented using a logic programming language extended with defeasible rules. This combination of ideas brings about a computationally effective system together with a human-like reasoning model facilitating its use in applications. (shrink)

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)

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)

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)

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)

Despite the fact that there is considerable evidence against the causal efficacy of proximal (short-term) conscious intentions, many studies confirm our commonsensical belief in the efficacy of more distal (longer-term) conscious intentions. In this paper, I address two questions: (i) What, if any, is the difference between the role of consciousness in effective and in non-effective conscious intentions? (ii) How do effective conscious distal intentions interact with unconscious processes in producing actions, and how do non-effective proximal intentions fit into this (...) process? I argue that answers to these questions point to a picture of distal conscious intending as a form of self-programming. The metaphor of ?self-programming? will be elucidated by using a distinction between ?structuring? and ?triggering? causes. Though the self-programming metaphor does not amount to a full theory of conscious intending, I argue that it may be a useful heuristic in developing such a theory. I also argue that the metaphor is phenomenologically plausible. (shrink)

Ethnographic study of the constitution of algorithms.

1. Do models formulated in programming languages use explicit rules where connectionist models do not? 2. Are rules as found in programming languages hard, precise, and exceptionless, where connectionist rules are not? 3. Do connectionist models use rules operating on distributed representations where models formulated in programming languages do not? 4. Do connectionist models fail to use structure sensitive rules of the sort found in "classical" computer architectures? In this chapter we argue that the answer to each (...) of these questions is negative. (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)

In the present article we exploit the logical notions of correctness and completeness to provide an analysis of some fundamental problems that can be encountered by a software developer when transforming norms for traffic circulation into programming instructions. Relying on this analysis, we then introduce a question and answer procedure that can be helpful, in case of an accident, to clarify which components of an existing framework should be revised and to what extent software developers can be held responsible.

Recent rapid advances in Artificial Intelligence (AI) and Machine Learning have raised many questions about the regulatory and governance mechanisms for autonomous machines. Many commentators, scholars, and policy-makers now call for ensuring that algorithms governing our lives are transparent, fair, and accountable. Here, I propose a conceptual framework for the regulation of AI and algorithmic systems. I argue that we need tools to program, debug and maintain an algorithmic social contract, a pact between various human stakeholders, mediated by machines. To (...) achieve this, we can adapt the concept of human-in-the-loop (HITL) from the fields of modeling and simulation, and interactive machine learning. In particular, I propose an agenda I call society-in-the-loop (SITL), which combines the HITL control paradigm with mechanisms for negotiating the values of various stakeholders affected by AI systems, and monitoring compliance with the agreement. In short, ‘SITL = HITL + Social Contract.’. (shrink)

In this paper, a complex non- linear programming problem with the two parts (real and imaginary) is considered. The efficient and proper efficient solutions in terms of optimal solutions of related appropriate scalar optimization problems are characterized. Also, the Kuhn-Tuckers' conditions for efficiency and proper efficiency are derived. This paper is divided into two independently parts: The first provides the relationships between the optimal solutions of a complex single-objective optimization problem and solutions of two related real programming problems. (...) The second part is concerned with the theory of a multi-objective optimization in complex space. (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)

This paper aims to assess selected municipalities’ performance of citizen-centric investment planning, governance and transparency, financial management, and support for youth programming in Kosovo. In completing this assessment, the Municipal Performance Management System of the Ministry of Local Government Administration in Kosovo was utilized. Selected municipalities are based on the Municipal Performance Report of 2019. Eight from Albanian majority municipalities in the top ranking, and two municipalities with higher scores from minority municipalities. The paper aims to highlight three critical (...) local government issues in ten selected municipalities: 1) The way of governing municipalities assessed according to the applicable legislation and 2) The provision of services in terms of quantity and quality, when possible and 3) Youth-oriented capacity building for municipal staff for better youth services. The paper will produce findings on capacity building needs and support needed on youth and citizen-centric investment and capacity building needs. A non-exhaustive list of needed capacities is produced, while the findings from the evaluation will be used to develop a capacity-building manual for municipal staff on youth-oriented municipal services. (shrink)

The topics of structural proof theory and logic programming have influenced each other for more than three decades. Proof theory has contributed the notion of sequent calculus, linear logic, and higher-order quantification. Logic programming has introduced new normal forms of proofs and forced the examination of logic-based approaches to the treatment of bindings. As a result, proof theory has responded by developing an approach to proof search based on focused proof systems in which introduction rules are organized into (...) two alternating phases of rule application. Since the logic programming community can generate many examples and many design goals, the close connections with proof theory have helped to keep proof theory relevant to the general topic of computational logic. (shrink)

Mathematical models are an important tool in the development ofsoftware technology, including programming languages and algorithms.During the last few years, a new class of such models has beendeveloped based on the notion of a mathematical game that isespecially well-suited to address the interactions between thecomponents of a system. This paper gives an introduction to thesegame-semantical models of programming languages, concentrating onmotivating the basic intuitions and putting them into context.

Computing with logic / Maier, D., Warren, D.S.

Harmonic Grammar (HG) is a model of linguistic constraint interaction in which well-formedness is calculated as the sum of weighted constraint violations. We show how linear programming algorithms can be used to determine whether there is a weighting for a set of constraints that fits a set of linguistic data. The associated software package OT-Help provides a practical tool for studying large and complex linguistic systems in the HG framework and comparing the results with those of OT. We describe (...) the translation from Harmonic Grammars to systems solvable by linear programming, and we illustrate the usefulness of OT-Help with a set of studies of the predictions HG makes for phonological typology. (shrink)

E-Z Reader achieves an impressive fit of empirical eye movement data by simulating core processes of reading in a computational approach that includes serial word processing, shifts of attention, and temporal overlap in the programming of saccades. However, when common assumptions for the time requirements of these processes are taken into account, severe constraints on the time line within which these elements can be combined become obvious. We argue that it appears difficult to accommodate these processes within a largely (...) sequential modeling framework such as E-Z Reader. (shrink)

Recently, there have been some attempts towards developing programming languages based on situation theory. These languages employ situation-theoretic constructs with varying degrees of divergence from the ontology of the theory. In this paper, we review three of these programming languages.

"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.

Mechanism design is an analytical framework for thinking clearly and carefully about what exactly a given institution can achieve when the information necessary to make decisions is dispersed and privately held. This analysis provides an account of the underlying mathematics of mechanism design based on linear programming. Three advantages characterize the approach. The first is simplicity: arguments based on linear programming are both elementary and transparent. The second is unity: the machinery of linear programming provides a way (...) to unify results from disparate areas of mechanism design. The third is reach: the technique offers the ability to solve problems that appear to be beyond solutions offered by traditional methods. No claim is made that the approach advocated should supplant traditional mathematical machinery. Rather, the approach represents an addition to the tools of the economic theorist who proposes to understand economic phenomena through the lens of mechanism design. (shrink)

We present an infinite-game characterization of the well-founded semantics for function-free logic programs with negation. Our game is a simple generalization of the standard game for negation-less logic programs introduced by van Emden [M.H. van Emden, Quantitative deduction and its fixpoint theory, Journal of Logic Programming 3 37–53] in which two players, the Believer and the Doubter, compete by trying to prove a query. The standard game is equivalent to the minimum Herbrand model semantics of logic programming in (...) the sense that a query succeeds in the minimum model semantics iff the Believer has a winning strategy for the game which begins with the Doubter doubting this query. The game for programs with negation that we propose follows the same rules as the standard one, except that the players swap roles every time the play “passes through” negation. We start our investigation by establishing the determinacy of the new game by using some classical tools from the theory of infinite-games. Our determinacy result immediately provides a novel and purely game-theoretic characterization of the semantics of negation in logic programming. We proceed to establish the connections of the game semantics to the existing semantic approaches for logic programming with negation. For this purpose, we first define a refined version of the game that uses degrees of winning and losing for the two players. We then demonstrate that this refined game corresponds exactly to the infinite-valued minimum model semantics of negation [P. Rondogiannis,W.W. Wadge, Minimum model semantics for logic programs with negation-as-failure, ACM Transactions on Computational Logic 6 441–467]. This immediately implies that the unrefined game is equivalent to the well-founded semantics. (shrink)