Goal-Directed Equation Solving

Nachum Dershowitz; G. Sivakumar

Goal-Directed Equation Solving

Nachum Dershowitz, G. Sivakumar

University of Illinois

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms. Our goal-directed equation solving procedure is based on "directed goals", and combines narrowing with a more top-down approach. We also show how to incorporate a notion of operator derivability to prune some useless paths, while maintaining completeness of the method.

Original language	English
Title of host publication	Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988
Publisher	AAAI press
Pages	166-170
Number of pages	5
ISBN (Electronic)	0262510553, 9780262510554
State	Published - 1988
Externally published	Yes
Event	7th National Conference on Artificial Intelligence, AAAI 1988 - St. Paul, United States Duration: 21 Aug 1988 → 26 Aug 1988

Publication series

Name	Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988

Conference

Conference	7th National Conference on Artificial Intelligence, AAAI 1988
Country/Territory	United States
City	St. Paul
Period	21/08/88 → 26/08/88

Funding

Funders	Funder number
National Science Foundation	DCR 85-13417

Cite this

@inproceedings{b6ca4a97577a49b292c6b7ad0b5601a6,

title = "Goal-Directed Equation Solving",

abstract = "Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms. Our goal-directed equation solving procedure is based on {"}directed goals{"}, and combines narrowing with a more top-down approach. We also show how to incorporate a notion of operator derivability to prune some useless paths, while maintaining completeness of the method.",

author = "Nachum Dershowitz and G. Sivakumar",

note = "Publisher Copyright: Copyright {\textcopyright} 1988, AAAI (www.aaai.org). All rights reserved.; 7th National Conference on Artificial Intelligence, AAAI 1988 ; Conference date: 21-08-1988 Through 26-08-1988",

year = "1988",

language = "אנגלית",

series = "Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988",

publisher = "AAAI press",

pages = "166--170",

booktitle = "Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988",

}

TY - GEN

T1 - Goal-Directed Equation Solving

AU - Dershowitz, Nachum

AU - Sivakumar, G.

PY - 1988

Y1 - 1988

N2 - Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms. Our goal-directed equation solving procedure is based on "directed goals", and combines narrowing with a more top-down approach. We also show how to incorporate a notion of operator derivability to prune some useless paths, while maintaining completeness of the method.

AB - Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms. Our goal-directed equation solving procedure is based on "directed goals", and combines narrowing with a more top-down approach. We also show how to incorporate a notion of operator derivability to prune some useless paths, while maintaining completeness of the method.

UR - http://www.scopus.com/inward/record.url?scp=33745187244&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33745187244

T3 - Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988

SP - 166

EP - 170

BT - Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988

PB - AAAI press

T2 - 7th National Conference on Artificial Intelligence, AAAI 1988

Y2 - 21 August 1988 through 26 August 1988

ER -

Goal-Directed Equation Solving

Abstract

Publication series

Conference

Funding

Other files and links

Fingerprint

Cite this