Using Model Theory to Specify AI Programs

Alan M. Frisch

Using Model Theory to Specify AI Programs

Computer Science

Research output: Contribution to conference › Paper

Abstract

This paper proposes a method for adapting the traditional devices of model theory to the task of specifying the input/output behavior of artificial intelligence reasoning programs when viewed as inference engines. The method is illustrated by specifying two programs, one a toy example and the other a program for retrieving information from a declarative knowledge base. Close examination shows that many intuitions about the properties of a retriever can be stated rigorously in terms of inference and that the model-theoretic specification can then be used to prove that the retriever has these properties.

Original language	Undefined/Unknown
Pages	148-154
Publication status	Published - 1985

Access to Document

http://portal.acm.org/citation.cfm?id=1625162

Cite this

@conference{7630552069e74fb79d5bdb07812e703d,

title = "Using Model Theory to Specify AI Programs",

abstract = "This paper proposes a method for adapting the traditional devices of model theory to the task of specifying the input/output behavior of artificial intelligence reasoning programs when viewed as inference engines. The method is illustrated by specifying two programs, one a toy example and the other a program for retrieving information from a declarative knowledge base. Close examination shows that many intuitions about the properties of a retriever can be stated rigorously in terms of inference and that the model-theoretic specification can then be used to prove that the retriever has these properties.",

author = "Frisch, {Alan M.}",

year = "1985",

language = "Undefined/Unknown",

pages = "148--154",

}

TY - CONF

T1 - Using Model Theory to Specify AI Programs

AU - Frisch, Alan M.

PY - 1985

Y1 - 1985

N2 - This paper proposes a method for adapting the traditional devices of model theory to the task of specifying the input/output behavior of artificial intelligence reasoning programs when viewed as inference engines. The method is illustrated by specifying two programs, one a toy example and the other a program for retrieving information from a declarative knowledge base. Close examination shows that many intuitions about the properties of a retriever can be stated rigorously in terms of inference and that the model-theoretic specification can then be used to prove that the retriever has these properties.

AB - This paper proposes a method for adapting the traditional devices of model theory to the task of specifying the input/output behavior of artificial intelligence reasoning programs when viewed as inference engines. The method is illustrated by specifying two programs, one a toy example and the other a program for retrieving information from a declarative knowledge base. Close examination shows that many intuitions about the properties of a retriever can be stated rigorously in terms of inference and that the model-theoretic specification can then be used to prove that the retriever has these properties.

M3 - Paper

SP - 148

EP - 154

ER -