Translating first-order theories into logic programs

Heng Zhang; Yan Zhang; Mingsheng Ying; Yi Zhou

doi:10.5591/978-1-57735-516-8/IJCAI11-192

Translating first-order theories into logic programs

Heng Zhang, Yan Zhang, Mingsheng Ying, Yi Zhou

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

5 Citations (Scopus)

Abstract

![CDATA[This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theories under these two semantics can then be handled by using existing answer set solvers. The effectiveness of this approach in computing hard problems beyond NP is demonstrated by some experiments.]]

Original language	English
Title of host publication	Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Catalonia, Spain, 16Ã¢€“22 July 2011
Publisher	AAAI Press
Pages	1126-1131
Number of pages	6
ISBN (Print)	9781577355120
DOIs	https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-192
Publication status	Published - 2011
Event	International Joint Conference on Artificial Intelligence - Duration: 3 Aug 2013 → …

Publication series

Name
ISSN (Print)	1045-0823

Conference

Conference	International Joint Conference on Artificial Intelligence
Period	3/08/13 → …

Access to Document

10.5591/978-1-57735-516-8/IJCAI11-192

Cite this

@inproceedings{b8f3668d248446eaa79798f429575687,

title = "Translating first-order theories into logic programs",

abstract = "![CDATA[This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theories under these two semantics can then be handled by using existing answer set solvers. The effectiveness of this approach in computing hard problems beyond NP is demonstrated by some experiments.]]",

author = "Heng Zhang and Yan Zhang and Mingsheng Ying and Yi Zhou",

year = "2011",

doi = "10.5591/978-1-57735-516-8/IJCAI11-192",

language = "English",

isbn = "9781577355120",

publisher = "AAAI Press",

pages = "1126--1131",

booktitle = "Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Catalonia, Spain, 16{\~A}¢€“22 July 2011",

note = "International Joint Conference on Artificial Intelligence ; Conference date: 03-08-2013",

}

Zhang, H, Zhang, Y, Ying, M & Zhou, Y 2011, Translating first-order theories into logic programs. in Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Catalonia, Spain, 16Ã¢€“22 July 2011. AAAI Press, pp. 1126-1131, International Joint Conference on Artificial Intelligence, 3/08/13. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-192

Translating first-order theories into logic programs. / Zhang, Heng; Zhang, Yan; Ying, Mingsheng et al.
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Catalonia, Spain, 16Ã¢€“22 July 2011. AAAI Press, 2011. p. 1126-1131.

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - Translating first-order theories into logic programs

AU - Zhang, Heng

AU - Zhang, Yan

AU - Ying, Mingsheng

AU - Zhou, Yi

PY - 2011

Y1 - 2011

N2 - ![CDATA[This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theories under these two semantics can then be handled by using existing answer set solvers. The effectiveness of this approach in computing hard problems beyond NP is demonstrated by some experiments.]]

AB - ![CDATA[This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theories under these two semantics can then be handled by using existing answer set solvers. The effectiveness of this approach in computing hard problems beyond NP is demonstrated by some experiments.]]

UR - http://handle.uws.edu.au:8081/1959.7/545551

UR - http://ijcai-11.iiia.csic.es/

U2 - 10.5591/978-1-57735-516-8/IJCAI11-192

DO - 10.5591/978-1-57735-516-8/IJCAI11-192

M3 - Conference Paper

SN - 9781577355120

SP - 1126

EP - 1131

BT - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Catalonia, Spain, 16Ã¢€“22 July 2011

PB - AAAI Press

T2 - International Joint Conference on Artificial Intelligence

Y2 - 3 August 2013

ER -

Translating first-order theories into logic programs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this