A polynomial-time algorithm for constructing k-maintainable policies

Chitta Baral; Thomas Eiter

A polynomial-time algorithm for constructing k-maintainable policies

Computer Science and Engineering

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

Abstract

In this paper we present a polynomial time algorithm for constructing k-maintainable policies (Nakamura Baral, & Bjareland 2000). Our algorithm, in polynomial time, constructs a k-maintainable control policy, if one exists, or tells that no such policy is possible. Our algorithm is based on SAT Solving, and employs a suitable formulation of the existence of k-maintainable control in a fragment of SAT which is tractable. We then give a logic programming implementation of our algorithm and use it to give a standard procedural algorithm. We then present several complexity results about constructing k-maintainable controls, under different assumptions such as k = 1, and compact representation.

Original language	English (US)
Title of host publication	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
Editors	S. Zilberstein, J. Koehler, S. Koenig
Pages	111-120
Number of pages	10
State	Published - Dec 1 2004
Event	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004 - Whistler, BC, Canada Duration: Jun 3 2004 → Jun 7 2004

Publication series

Name	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Other

Other	Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
Country/Territory	Canada
City	Whistler, BC
Period	6/3/04 → 6/7/04

ASJC Scopus subject areas

Engineering(all)

Cite this

A polynomial-time algorithm for constructing k-maintainable policies. / Baral, Chitta; Eiter, Thomas.
Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004. ed. / S. Zilberstein; J. Koehler; S. Koenig. 2004. p. 111-120 (Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004).

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

Baral, C & Eiter, T 2004, A polynomial-time algorithm for constructing k-maintainable policies. in S Zilberstein, J Koehler & S Koenig (eds), Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004, pp. 111-120, Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004, Whistler, BC, Canada, 6/3/04.

Baral, Chitta ; Eiter, Thomas. / A polynomial-time algorithm for constructing k-maintainable policies. Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004. editor / S. Zilberstein ; J. Koehler ; S. Koenig. 2004. pp. 111-120 (Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004).

@inproceedings{1ded5c8cac11471e82c57c1f0710e01d,

title = "A polynomial-time algorithm for constructing k-maintainable policies",

abstract = "In this paper we present a polynomial time algorithm for constructing k-maintainable policies (Nakamura Baral, & Bjareland 2000). Our algorithm, in polynomial time, constructs a k-maintainable control policy, if one exists, or tells that no such policy is possible. Our algorithm is based on SAT Solving, and employs a suitable formulation of the existence of k-maintainable control in a fragment of SAT which is tractable. We then give a logic programming implementation of our algorithm and use it to give a standard procedural algorithm. We then present several complexity results about constructing k-maintainable controls, under different assumptions such as k = 1, and compact representation.",

author = "Chitta Baral and Thomas Eiter",

year = "2004",

month = dec,

day = "1",

language = "English (US)",

isbn = "1577352009",

series = "Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004",

pages = "111--120",

editor = "S. Zilberstein and J. Koehler and S. Koenig",

booktitle = "Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004",

note = "Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004 ; Conference date: 03-06-2004 Through 07-06-2004",

}

TY - GEN

T1 - A polynomial-time algorithm for constructing k-maintainable policies

AU - Baral, Chitta

AU - Eiter, Thomas

PY - 2004/12/1

Y1 - 2004/12/1

N2 - In this paper we present a polynomial time algorithm for constructing k-maintainable policies (Nakamura Baral, & Bjareland 2000). Our algorithm, in polynomial time, constructs a k-maintainable control policy, if one exists, or tells that no such policy is possible. Our algorithm is based on SAT Solving, and employs a suitable formulation of the existence of k-maintainable control in a fragment of SAT which is tractable. We then give a logic programming implementation of our algorithm and use it to give a standard procedural algorithm. We then present several complexity results about constructing k-maintainable controls, under different assumptions such as k = 1, and compact representation.

AB - In this paper we present a polynomial time algorithm for constructing k-maintainable policies (Nakamura Baral, & Bjareland 2000). Our algorithm, in polynomial time, constructs a k-maintainable control policy, if one exists, or tells that no such policy is possible. Our algorithm is based on SAT Solving, and employs a suitable formulation of the existence of k-maintainable control in a fragment of SAT which is tractable. We then give a logic programming implementation of our algorithm and use it to give a standard procedural algorithm. We then present several complexity results about constructing k-maintainable controls, under different assumptions such as k = 1, and compact representation.

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

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

M3 - Conference contribution

AN - SCOPUS:13444284034

SN - 1577352009

SN - 9781577352006

T3 - Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

SP - 111

EP - 120

BT - Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

A2 - Zilberstein, S.

A2 - Koehler, J.

A2 - Koenig, S.

T2 - Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Y2 - 3 June 2004 through 7 June 2004

ER -

A polynomial-time algorithm for constructing k-maintainable policies

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this