• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 46
Next 10 →

Applications Of Circumscription To Formalizing Common Sense Knowledge

by John McCarthy - Artificial Intelligence , 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract - Cited by 532 (12 self) - Add to MetaCart
general formalism called prioritized circumscription is briefly explored. 1 INTRODUCTION ANDNEW DEFINITION OF CIRCUMSCRIPTION (McCarthy 1980) introduces the circumscription method of nonmonotonic reasoning and gives motivation, some mathematical properties and some ex1 amples of its application

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

by John Mccarthy , 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract - Cited by 457 (3 self) - Add to MetaCart
this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science

Definitional interpreters for higher-order programming languages

by John C. Reynolds - Reprinted from the proceedings of the 25th ACM National Conference , 1972
"... Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include ..."
Abstract - Cited by 338 (2 self) - Add to MetaCart
McCarthy’s definition of LISP, Landin’s SECD machine, the Vienna definition of PL/I, Reynolds ’ definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether

The background of Australian archreology has been fully discussed by McCarthy

by Frederick D. Mccarthy
"... (1961). In this paper a summary of current work and opinions is given. Excavations and Prehistoric Cultures The few isolated sites that have been dug in the various states of Australia have proved to be important index sites to the industries and cultures that are being found elsewhere on that conti ..."
Abstract - Add to MetaCart
on that continent. Three periods are definitely established in an eastern group. The uniface pebble implements, including the Sumatralith, together with hammerstones and horsehoof cores are considered by Tindale and Maegraith (193 1) and Cooper (1943) as characteristic of the Kartan culture on Kangaroo island

Proving Properties of Programs by Structural Induction

by R. M. Burstall - Computer Journal , 1969
"... This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without assignments ..."
Abstract - Cited by 101 (0 self) - Add to MetaCart
This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without

Stable Models and Circumscription

by Paolo Ferraris , Joohyung Lee , Vladimir Lifschitz , 2007
"... The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming (includ ..."
Abstract - Cited by 71 (37 self) - Add to MetaCart
from John McCarthy’s definition of circumscription.

Semantics of a Call-by-Need Lambda Calculus with McCarthy’s amb for Program Equivalence

by David Sabel - FRANKFURT AM MAIN, GERMANY , 2008
"... In this thesis we investigate the semantics of concurrent programming languages with respect to the correctness of program transformations which occur during compilation of programs. We investigate the correctness of transformations on the same language, as well as the correctness of transformations ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
-theoretic models in denotational semantics. Especially, for an amb-operator observing may-convergence only is too weak, since in this case the operator amb cannot be distinguished from erratic choice, hence bottom-avoidance would be meaningless. A novelty of our approach is our definition of must-convergence which

INTEGRATING THE PSYCHOSOCIAL (B MCCARTHY, RT SEGRAVES AND AH CLAYTON, SECTION EDITORS) Sexual Issues in Treating Trauma Survivors

by Aline P. Zoldbrod , 2014
"... # The Author(s) 2014. This article is published with open access at Springerlink.com Abstract The effect of interpersonal trauma on sexuality can be profound. The field of sexual trauma is complex empirically and clinically, with contradictory theories and conflicting data. Research definitions and ..."
Abstract - Add to MetaCart
# The Author(s) 2014. This article is published with open access at Springerlink.com Abstract The effect of interpersonal trauma on sexuality can be profound. The field of sexual trauma is complex empirically and clinically, with contradictory theories and conflicting data. Research definitions

Recursive programs as definitions in first order logic

by Robert Cartwright - SIAM Journal on Computing , 1984
"... Abstract. Despite the reputed limitations of first order logic, it is easy to state and prove almost all interesting properties of recursive programs within a simple first order theory, by using an approach we call "first order programming logic". Unlike higher order logics based on fixed- ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
-point induction, first order programming logic is founded on deductive principles that are familiar to most programmers. Informal structural induction arguments (such as termination proofs for LISP append, McCarthy’s 91-function, and Ackermann’s function) have direct formalizations within the system

THE OTHER IS ONESELF. AN EXPANSIVE DEFINITION OF POSTCOLONIAL IDENTITY

by David T. Lohrey
"... ABSTRACT. This paper examines the relationship between war and postcolonial identity in works by a range of African and American writers of 20th century fiction. This inquiry focuses on ‘literature of the displaced author’, as expressed in fictional writings which show the ways per-sonal trauma are ..."
Abstract - Add to MetaCart
into the twenty-first. It argues that World War I and World War II have had a profound impact on shaping the way life has been lived as seen in work by African writers such as J. M. Coetzee, Nadine Gordimer, and Doris Lessing, and Americans, such as Saul Bellow, Cormac McCarthy, and Philip Roth. Through
Next 10 →
Results 1 - 10 of 46
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University