AUB ScholarWorks

Weak and dynamic controllability of temporal problems with disjunctions and uncertainty

Show simple item record

dc.contributor.author Brent Venable K.
dc.contributor.author Volpato M.
dc.contributor.author Peintner B.
dc.contributor.author Yorke-Smith N.
dc.contributor.editor
dc.date 2010
dc.date.accessioned 2017-09-07T07:51:22Z
dc.date.available 2017-09-07T07:51:22Z
dc.date.issued 2010
dc.identifier
dc.identifier.isbn
dc.identifier.issn
dc.identifier.uri http://hdl.handle.net/10938/12112
dc.description.abstract The Temporal Constraint Satisfaction Problem with Uncertainty (TCSPU) and its disjunctive generalization, the Disjunctive Temporal Problem with Uncertainty (DTPU), are quantitative models for temporal reasoning that account simultaneously for disjunctive constraints and for events not under the control of the executing agent. Such a problem is Weakly Controllable if in each possible scenario the agent can find a decision for that scenario that satisfies all the constraints; further, a problem is Dynamically Controllable if the agent can build a consistent decision online, as the scenario is incrementally revealed. We first consider Weak Controllability. We present two sound and complete algorithms for checking Weak Controllability of DTPUs. The first algorithm needs to examine only a limited number of scenarios, but operates only on a restricted class of problems. The second algorithm is fully general, but is more expensive in terms of space. We then consider Dynamic Controllability. We present a complete algorithm for testing this property for TCSPUs. Complexity results are presented for all three algorithms. © 2010, Association for the Advancement of Artificial Intelligence.
dc.format.extent
dc.format.extent Pages: (50-59)
dc.language English
dc.relation.ispartof Publication Name: COPLAS 2010 - Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems; Conference Title: Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2010; Conference Date: 12 May 2010 through 12 May 2010; Conference Location: Toronto, ON; Publication Year: 2010; Pages: (50-59);
dc.relation.ispartofseries
dc.relation.uri
dc.source Scopus
dc.subject.other
dc.title Weak and dynamic controllability of temporal problems with disjunctions and uncertainty
dc.type Conference Paper
dc.contributor.affiliation Brent Venable, K., University of Padova, Italy
dc.contributor.affiliation Volpato, M., University of Padova, Italy
dc.contributor.affiliation Peintner, B., Artificial Intelligence Center, SRI International, United States
dc.contributor.affiliation Yorke-Smith, N., American University of Beirut, SRI International, United States
dc.contributor.authorAddress Brent Venable, K.; University of PadovaItaly; email: kvenable@math.unipd.it
dc.contributor.authorCorporate University: American University of Beirut; Faculty: Suliman S. Olayan School of Business; Department: School of Business;
dc.contributor.authorDepartment School of Business
dc.contributor.authorDivision
dc.contributor.authorEmail
dc.contributor.authorFaculty Suliman S. Olayan School of Business
dc.contributor.authorInitials
dc.contributor.authorOrcidID
dc.contributor.authorReprintAddress
dc.contributor.authorResearcherID
dc.contributor.authorUniversity American University of Beirut
dc.description.cited
dc.description.citedCount
dc.description.citedTotWOSCount
dc.description.citedWOSCount
dc.format.extentCount 10
dc.identifier.articleNo
dc.identifier.coden
dc.identifier.pubmedID
dc.identifier.scopusID 84857857725
dc.identifier.url
dc.publisher.address
dc.relation.ispartofConference Conference Title: Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2010 : Conference Date: 12 May 2010 through 12 May 2010 , Conference Location: Toronto, ON.
dc.relation.ispartofConferenceCode 88828
dc.relation.ispartofConferenceDate 12 May 2010 through 12 May 2010
dc.relation.ispartofConferenceHosting
dc.relation.ispartofConferenceLoc Toronto, ON
dc.relation.ispartofConferenceSponsor
dc.relation.ispartofConferenceTitle Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2010
dc.relation.ispartofFundingAgency
dc.relation.ispartOfISOAbbr
dc.relation.ispartOfIssue
dc.relation.ispartOfPart
dc.relation.ispartofPubTitle COPLAS 2010 - Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems
dc.relation.ispartofPubTitleAbbr COPLAS - Proc. Workshop Constraint Satisfaction Tech. Plann. Scheduling Probl.
dc.relation.ispartOfSpecialIssue
dc.relation.ispartOfSuppl
dc.relation.ispartOfVolume
dc.source.ID
dc.type.publication Series
dc.subject.otherAuthKeyword
dc.subject.otherChemCAS
dc.subject.otherIndex Complexity Results
dc.subject.otherIndex Disjunctive Constraints
dc.subject.otherIndex Dynamic Controllability
dc.subject.otherIndex Quantitative Models
dc.subject.otherIndex Temporal Constraint Satisfaction Problems
dc.subject.otherIndex Temporal Reasoning
dc.subject.otherIndex Weak Controllability
dc.subject.otherIndex Algorithms


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


Browse

My Account