Search results for 'Recursive programming' (try it on Scholar)

1000+ found
Order:
  1. Krzysztof R. Apt & Association for Logic Programming (1992). Logic Programming Proceedings of the Joint International Conference and Symposium on Logic Programming. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  2. K. L. Clark, S. Tärnlund & International Workshop on Logic Programming (1982). Logic Programming.
    No categories
     
    Export citation  
     
    My bibliography  
  3. J. Dix, Luís Moniz Pereira, Teodor C. Przymusinski & International Conference on Logic Programming (1995). Non-Monotonic Extensions of Logic Programming Iclp '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994 : Selected Papers. [REVIEW]
    No categories
     
    Export citation  
     
    My bibliography  
  4. Robert Kowalski, Kenneth A. Bowen, Association for Logic Programming, Ieee Computer Society & Symposium on Logic Programming (1988). Logic Programming Proceedings of the Fifth International Conference and Symposium. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  5. Wiktor Marek, Anil Nerode, V. S. Subrahmanian & Association for Logic Programming (1991). Logic Programming and Non-Monotonic Reasoning Proceedings of the First International Workshop. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  6. Dale Miller & Association for Logic Programming (1993). Logic Programming Proceedings of the 1993 International Symposium. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  7. Peter Szeredi, David H. D. Warren & International Conference on Logic Programming (1990). Logic Programming Proceedings of the Seventh International Conference. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography  
  8. Evan Tick, Giancarlo Succi & International Conference on Logic Programming (1994). Implementations of Logic Programming Systems.
    No categories
     
    Export citation  
     
    My bibliography  
  9.  4
    Enric Casaban Moya (1972). Recursive Techniques in Programming, de DW Barron. Teorema: International Journal of Philosophy 2 (5):136-138.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  10. J. W. Klop (1980). Combinatory Reduction Systems. Mathematisch Centrum.
     
    Export citation  
     
    My bibliography   2 citations  
  11.  5
    Stefano Mazzanti (1997). Iterative Characterizations of Computable Unary Functions: A General Method. Mathematical Logic Quarterly 43 (1):29-38.
    Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving very nice features.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12. Bruno Buchberger (1972). A Study on Universal Functions. Institut Für Numerische Mathematik Und Elektronische Informationsverarbeitung, Universität Innsbruck.
    No categories
     
    Export citation  
     
    My bibliography  
  13.  2
    Karl-Heinz Niggl (1999). Mω Considered as a Programming Language. Annals of Pure and Applied Logic 99 (1-3):73-92.
    The paper studies a simply typed term system Mω providing a primitive recursive concept of parallelism in the sense of Plotkin. The system aims at defining and computing partial continuous functionals. Some connections between denotational and operational semantics → for Mω are investigated. It is shown that → is correct with respect to the denotational semantics. Conversely, → is complete in the sense that if a program denotes some number k, then it is reducible to the numeral nk. Restricting (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14.  7
    H. Rogers (1987). Theory of Recursive Functions and Effective Computability. MIT Press.
  15.  22
    Sujoy Chakravarty & Jaideep Roy (2009). Recursive Expected Utility and the Separation of Attitudes Towards Risk and Ambiguity: An Experimental Study. [REVIEW] Theory and Decision 66 (3):199-228.
    We use the multiple price list method and a recursive expected utility theory of smooth ambiguity to separate out attitude towards risk from that towards ambiguity. Based on this separation, we investigate if there are differences in agent behaviour under uncertainty over gain amounts vis-a-vis uncertainty over loss amounts. On an aggregate level, we find that (i) subjects are risk averse over gains and risk seeking over losses, displaying a “reflection effect” and (ii) they are ambiguity neutral over gains (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  16.  20
    Raymond Turner (2014). Programming Languages as Technical Artifacts. Philosophy and Technology 27 (3):377-397.
    Taken at face value, a programming language is defined by a formal grammar. But, clearly, there is more to it. By themselves, the naked strings of the language do not determine when a program is correct relative to some specification. For this, the constructs of the language must be given some semantic content. Moreover, to be employed to generate physical computations, a programming language must have a physical implementation. How are we to conceptualize this complex package? Ontologically, what (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  17.  49
    Steve Awodey, Type Theory and Homotopy.
    of type theory has been used successfully to formalize large parts of constructive mathematics, such as the theory of generalized recursive definitions [NPS90, ML79]. Moreover, it is also employed extensively as a framework for the development of high-level programming languages, in virtue of its combination of expressive strength and desirable proof-theoretic properties [NPS90, Str91]. In addition to simple types A, B, . . . and their terms x : A b(x) : B, the theory also has dependent types (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  18.  22
    J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.
    Combinatory logic and lambda-conversion were originally devised in the 1920s for investigating the foundations of mathematics using the basic concept of 'operation' instead of 'set'. They have now developed into linguistic tools, useful in several branches of logic and computer science, especially in the study of programming languages. These notes form a simple introduction to the two topics, suitable for a reader who has no previous knowledge of combinatory logic, but has taken an undergraduate course in predicate calculus and (...)
    Direct download  
     
    Export citation  
     
    My bibliography   11 citations  
  19.  15
    Yining Wu, Martin Caminada & Dov M. Gabbay (2009). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica 93 (2/3):383 - 403.
    In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  20. Domenico Zambella & Antonella Mancini (2001). A Note on Recursive Models of Set Theories. Notre Dame Journal of Formal Logic 42 (2):109-115.
    We construct two recursive models of fragments of set theory. We also show that the fragments of Kripke-Platek set theory that prove -induction for -formulas have no recursive models but the standard model of the hereditarily finite sets.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  21.  32
    Raymond Turner (2007). Understanding Programming Languages. Minds and Machines 17 (2):203-216.
    We document the influence on programming language semantics of the Platonism/formalism divide in the philosophy of mathematics.
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  22.  15
    Jean-Gabriel Ganascia (2007). Modelling Ethical Rules of Lying with Answer Set Programming. Ethics and Information Technology 9 (1):39-47.
    There has been considerable discussion in the past about the assumptions and basis of different ethical rules. For instance, it is commonplace to say that ethical rules are defaults rules, which means that they tolerate exceptions. Some authors argue that morality can only be grounded in particular cases while others defend the existence of general principles related to ethical rules. Our purpose here is not to justify either position, but to try to model general ethical rules with artificial intelligence formalisms (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  23.  8
    Alexander Kreuzer & Ulrich Kohlenbach (2009). Ramsey's Theorem for Pairs and Provably Recursive Functions. Notre Dame Journal of Formal Logic 50 (4):427-444.
    This paper addresses the strength of Ramsey's theorem for pairs ($RT^2_2$) over a weak base theory from the perspective of 'proof mining'. Let $RT^{2-}_2$ denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of $\Sigma^0_1$-induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24. Stefano Berardi & Yoriyuki Yamagata (2008). A Sequent Calculus for Limit Computable Mathematics. Annals of Pure and Applied Logic 153 (1):111-126.
    We introduce an implication-free fragment image of ω-arithmetic, having Exchange rule for sequents dropped. Exchange rule for formulas is, instead, an admissible rule in image. Our main result is that cut-free proofs of image are isomorphic with recursive winning strategies of a set of games called “1-backtracking games” in [S. Berardi, Th. Coquand, S. Hayashi, Games with 1-backtracking, Games for Logic and Programming Languages, Edinburgh, April 2005].We also show that image is a sound and complete formal system for (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  25.  32
    José Saias & Paulo Quaresma (2004). A Methodology to Create Legal Ontologies in a Logic Programming Based Web Information Retrieval System. Artificial Intelligence and Law 12 (4):397-417.
    Web legal information retrieval systems need the capability to reason with the knowledge modeled by legal ontologies. Using this knowledge it is possible to represent and to make inferences about the semantic content of legal documents. In this paper a methodology for applying NLP techniques to automatically create a legal ontology is proposed. The ontology is defined in the OWL semantic web language and it is used in a logic programming framework, EVOLP+ISCO, to allow users to query the semantic (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  26.  25
    Giuseppe Longo & Pierre-Emmanuel Tendero (2007). The Differential Method and the Causal Incompleteness of Programming Theory in Molecular Biology. Foundations of Science 12 (4):337-366.
    The “DNA is a program” metaphor is still widely used in Molecular Biology and its popularization. There are good historical reasons for the use of such a metaphor or theoretical model. Yet we argue that both the metaphor and the model are essentially inadequate also from the point of view of Physics and Computer Science. Relevant work has already been done, in Biology, criticizing the programming paradigm. We will refer to empirical evidence and theoretical writings in Biology, although our (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  27.  20
    Enrique Frias-Martinez & Fernand Gobet (2007). Automatic Generation of Cognitive Theories Using Genetic Programming. Minds and Machines 17 (3):287-309.
    Cognitive neuroscience is the branch of neuroscience that studies the neural mechanisms underpinning cognition and develops theories explaining them. Within cognitive neuroscience, computational neuroscience focuses on modeling behavior, using theories expressed as computer programs. Up to now, computational theories have been formulated by neuroscientists. In this paper, we present a new approach to theory development in neuroscience: the automatic generation and testing of cognitive theories using genetic programming (GP). Our approach evolves from experimental data cognitive theories that explain “the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  28.  8
    Daniel E. Severin (2008). Unary Primitive Recursive Functions. Journal of Symbolic Logic 73 (4):1122-1138.
    In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone. We reduce certain recursion schemes (mixed/pure iteration without parameters) and we characterize one-argument primitive recursive functions as the closure under substitution and iteration of certain optimal sets.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  29.  53
    Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
    We show that to every recursive total continuous functional Φ there is a PCF-definable representative Ψ of Φ in the hierarchy of partial continuous functionals, where PCF is Plotkin's programming language for computable functionals. PCF-definable is equivalent to Kleene's S1-S9-computable over the partial continuous functionals.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  30.  9
    Jakob G. Simonsen (2006). On Local Non‐Compactness in Recursive Mathematics. Mathematical Logic Quarterly 52 (4):323-330.
    A metric space is said to be locally non-compact if every neighborhood contains a sequence that is eventually bounded away from every element of the space, hence contains no accumulation point. We show within recursive mathematics that a nonvoid complete metric space is locally non-compact iff it is without isolated points.The result has an interesting consequence in computable analysis: If a complete metric space has a computable witness that it is without isolated points, then every neighborhood contains a computable (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  31.  5
    Ian H. Witten, Bruce A. MacDonald, David L. Maulsby & Rosanna Heise (1992). Programming by Example: The Human Face of AI. [REVIEW] AI and Society 6 (2):166-180.
    It is argued that “human-centredness” will be an important characteristic of systems that learn tasks from human users, as the difficulties in inductive inference rule out learning without human assistance. The aim of “programming by example” is to create systems that learn how to perform tasks from their human users by being shown examples of what is to be done. Just as the user creates a learning environment for the system, so the system provides a teaching opportunity for (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  32.  10
    Michael Gabbay (2011). A Proof-Theoretic Treatment of Λ-Reduction with Cut-Elimination: Λ-Calculus as a Logic Programming Language. Journal of Symbolic Logic 76 (2):673 - 699.
    We build on an existing a term-sequent logic for the λ-calculus. We formulate a general sequent system that fully integrates αβη-reductions between untyped λ-terms into first order logic. We prove a cut-elimination result and then offer an application of cut-elimination by giving a notion of uniform proof for λ-terms. We suggest how this allows us to view the calculus of untyped αβ-reductions as a logic programming language (as well as a functional programming language, as it is traditionally seen).
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33.  8
    Vitali Tselishchev (2008). Intuition and Reality of Signs. Proceedings of the Xxii World Congress of Philosophy 41:57-63.
    The progress in computer programming leads to the shift in traditional correlation between intuitive and formal components of mathematical knowledge. From epistemological point of view the role of intuition decreases in compare with formal representation of mathematical structures. The relevant explanation is to be found in D. Hilbert’s formalism and corresponding Kantian’s motives in it. The notion of sign belongs to both areas under consideration: on the one hand it is object of intuition in Kantian de re sense, on (...)
    No categories
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34.  7
    Özgür Kıbrıs (2013). On Recursive Solutions to Simple Allocation Problems. Theory and Decision 75 (3):449-463.
    We propose and axiomatically analyze a class of rational solutions to simple allocation problems where a policy-maker allocates an endowment $E$ among $n$ agents described by a characteristic vector c. We propose a class of recursive rules which mimic a decision process where the policy-maker initially starts with a reference allocation of $E$ in mind and then uses the data of the problem to recursively adjust his previous allocation decisions. We show that recursive rules uniquely satisfy rationality, c-continuity, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  35.  10
    Helena Rasiowa (1979). Algorithmic Logic. Multiple-Valued Extensions. Studia Logica 38 (4):317 - 335.
    Extended algorithmic logic (EAL) as introduced in [18] is a modified version of extended +-valued algorithmic logic. Only two-valued predicates and two-valued propositional variables occur in EAL. The role of the +-valued logic is restricted to construct control systems (stacks) of pushdown algorithms whereas their actions are described by means of the two-valued logic. Thus EAL formalizes a programming theory with recursive procedures but without the instruction CASE.The aim of this paper is to discuss EAL and prove the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  36.  2
    W. Degen (2002). Factors of Functions, AC and Recursive Analogues. Mathematical Logic Quarterly 48 (1):73-86.
    We investigate certain statements about factors of unary functions which have connections with weak forms of the axiom of choice. We discuss more extensively the fine structure of Howard and Rubin's Form 314 from [4]. Some of our set-theoretic results have also interesting recursive versions.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  37.  5
    Iraj Kalantari & Larry Welch (2004). Density and Baire Category in Recursive Topology. Mathematical Logic Quarterly 50 (4‐5):381-391.
    We develop the concepts of recursively nowhere dense sets and sets that are recursively of first category and study closed sets of points in light of Baire's Category Theorem. Our theorems are primarily concerned with exdomains of recursive quantum functions and hence with avoidable points . An avoidance function is a recursive function which can be used to expel avoidable points from domains of recursive quantum functions. We define an avoidable set of points to be an arbitrary (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  38.  17
    Karel Lambert (2001). From Predication to Programming. Minds and Machines 11 (2):257-265.
    A free logic is one in which a singular term can fail to refer to an existent object, for example, `Vulcan' or `5/0'. This essay demonstrates the fruitfulness of a version of this non-classical logic of terms (negative free logic) by showing (1) how it can be used not only to repair a looming inconsistency in Quine's theory of predication, the most influential semantical theory in contemporary philosophical logic, but also (2) how Beeson, Farmer and Feferman, among others, use it (...)
    Direct download (11 more)  
     
    Export citation  
     
    My bibliography  
  39.  2
    Christopher J. Ash & Julia F. Knight (1994). A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas. Mathematical Logic Quarterly 40 (2):173-181.
    We consider the following generalization of the notion of a structure recursive relative to a set X. A relational structure A is said to be a Γ-structure if for each relation symbol R, the interpretation of R in A is ∑math image relative to X, where β = Γ. We show that a certain, fairly obvious, description of classes ∑math image of recursive infinitary formulas has the property that if A is a Γ-structure and S is a further (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  40.  9
    Timothy R. Colburn (1991). Defeasible Reasoning and Logic Programming. Minds and Machines 1 (4):417-436.
    The general conditions of epistemic defeat are naturally represented through the interplay of two distinct kinds of entailment, deductive and defeasible. Many of the current approaches to modeling defeasible reasoning seek to define defeasible entailment via model-theoretic notions like truth and satisfiability, which, I argue, fails to capture this fundamental distinction between truthpreserving and justification-preserving entailments. I present an alternative account of defeasible entailment and show how logic programming offers a paradigm in which the distinction can be captured, allowing (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  41. J. Raymundo Marcial‐Romero & M. Andrew Moshier (2008). Sequential Real Number Computation and Recursive Relations. Mathematical Logic Quarterly 54 (5):492-507.
    In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes a proof that all polynomials are programmable, but that work comes short of giving a complete characterization of the expressive power of the language even for first-order functions. The technical problem is that LRT is non-deterministic. So a natural characterization of its expressive power should be in terms of relations rather than in terms of functions. In [2], Brattka examines a formalization (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  42.  2
    Luis E. Sanchis (1992). Recursive Functionals. North-Holland.
    This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results.
    Direct download  
     
    Export citation  
     
    My bibliography  
  43.  2
    J. W. Lloyd (1987). Foundations of Logic Programming. Journal of Symbolic Logic 52 (1):288-289.
    Direct download  
     
    Export citation  
     
    My bibliography   48 citations  
  44.  16
    Virginie Lecomte, Neil A. Youngson, Christopher A. Maloney & Margaret J. Morris (2013). Parental Programming: How Can We Improve Study Design to Discern the Molecular Mechanisms? Bioessays 35 (9):787-793.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  45. Dov M. Gabbay, Christopher John Hogger & J. A. Robinson (1993). Handbook of Logic in Artificial Intelligence and Logic Programming. Monograph Collection (Matt - Pseudo).
     
    Export citation  
     
    My bibliography   4 citations  
  46. Dale Miller (1991). A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. Lfcs, Department of Computer Science, University of Edinburgh.
    No categories
     
    Export citation  
     
    My bibliography   3 citations  
  47.  1
    Christopher J. Ash & Julia F. Knight (1996). Recursive Structures and Ershov's Hierarchy. Mathematical Logic Quarterly 42 (1):461-468.
    Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δmath image sets, giving conditions under which a relation is intrinsically α-r. e.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  48. Krzysztof R. Apt (1997). From Logic Programming to Prolog.
    No categories
     
    Export citation  
     
    My bibliography   1 citation  
  49.  4
    N. D. Jones (1997). Computability and Complexity: From a Programming Perspective Vol. 21. MIT Press.
    This makes his book especially valuable." -- Yuri Gurevich, Professor of Computer Science, University of Michigan Computability and complexity theory should be of central concern to practitioners as well as theorists.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  50. Krzysztof R. Apt & Franco Turini (1995). Meta-Logics and Logic Programming. Monograph Collection (Matt - Pseudo).
     
    Export citation  
     
    My bibliography   1 citation  
1 — 50 / 1000