• Corpus ID: 12065274

In Defense of Logic

  title={In Defense of Logic},
  author={Patrick J. Hayes},
  • P. Hayes
  • Published in IJCAI 22 August 1977
  • Philosophy

Sense and Reference on the Web

  • H. Halpin
  • Philosophy, Computer Science
    Minds and Machines
  • 2011
Debates on the Semantic Web about the meaning and referential status of a URI are explored as analogues to debates about themeaning and reference of names in the philosophy of language, showing that debates within the Philosophy of language are alive and well on the Web, and so in the philosophies of computer science.


! " " # # $% # & '( *),+ -/.0-1 2 # 3 4 3 5 6 47 #8# 4 6 9 # ' 4 :0 4 7 7 6 4 ; 4 2 9?, 2 9 2 @ ?, 6 9 6 3 $A =?, . BC 4 47 , # ! 4 ! # # !D # E 4 F ! ( ' 2 G # 3 4 3 H E .0IJ 2 K L 7 L # 4 LD

Baby Bottle Boiling Water Ice Water

ion in physical reasoning. Approximation and abstraction in physical reasoning takes many forms: Objects of complex characteristics can be approximated by objects of simpler characteristics (for

Classification Problem Solving

A broad range of heuristic programs—embracing forms of diagnosis, catalog selection, and skeletal planning—accomplish a kind of well-structured problem solving called classification, which provides a useful framework for recognizing and representing similar problems, for designing representation tools, and for understanding why non-classification problems require different problem-solving methods.

Teaching Classification Problem Solving

A study of the heuristic programs called "expert systems" indicates that reasoning involved in selecting a product or service is characterized by the same inference structure as that involved in identification of an unknown object or phenomenon.

Prometheus unbound or paradise regained - the concept of causality in the contemporary AI-data science debate

This essay highlights some aspects, core themes and controversies regarding causality from a historicalphilosophical perspective with special attention to their role in the AI-data science debate.

On Defining Artificial Intelligence

  • Pei Wang
  • Computer Science
    J. Artif. Gen. Intell.
  • 2019
This article systematically analyzes the problem of defining “artificial intelligence,” and establishes four criteria of a good working definition of a notion: being similar to its common usage, drawing a sharp boundary, leading to fruitful research, and as simple as possible.

Toward a Logic of Everyday Reasoning

  • Pei Wang
  • Computer Science, Philosophy
    Springer Series in Cognitive and Neural Systems
  • 2019
NAL (Non-Axiomatic Logic) is built for this purpose, which is based on the assumption that the reasoner has insufficient knowledge and resources with respect to the reasoning tasks to be carried out and provides a coherent solution to many problems in logic, artificial intelligence, and cognitive science.

Commonsense reasoning about containers using radically incomplete information




Extending the expressive power of semantic network

"Factual knowledge" used by natural language processing systems can be constructively represented in the form of semantic networks. Compared to a "linear" representation such as that of the Predicate

An artificial intelligence approach to machine translation.

It is claimed that the system of notation and translation described is a convenient one for expressing and handling the items of semantic information that are ESSENTIAL to any effective MT system and discusses in some detail the semantic information needed to ensure the correct choice of output prepositions in French.

Experiments with the Graph Traverser program

  • J. DoranD. Michie
  • Computer Science
    Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences
  • 1966
An automatic method is described for the solution of a certain family of problems that depends upon the evaluation of intermediate states of the problem according to the extent to which they have features in common with the goal state.

From PLANNER to CONNIVER: a genetic approach

To be good, a higher level language must not only simplify the job of programming, by providing features which package programming structures commonly found in the domain for which the language was designed, it must also do its best to discourage the use of structures which lead to bad algorithms.

A Planning System for Robot Construction Tasks

On Overview of KRL, a Knowledge Representation Language

KRL is an attempt to integrate procedural knowledge with a broad base of declarative forms to give flexibility in associating procedures with specific pieces of knowledge, and to control the relative accessibility of different facts and descriptions.