Show simple item record

dc.contributor.authorEast, Deborahen_US
dc.date.accessioned2006-10-16T10:03:29Z
dc.date.available2012-02-24T10:03:28Z
dc.date.issued2006-06-30en_US
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/2579
dc.descriptionReport Number TXSTATE-CS-TR-2006-3en_US
dc.description.abstractContract bridge is a popular and complex card game which has two distinct phases: the auction (bidding) and play. The result of the bidding is a contract (the number of tricks to be taken during play and the trump suit). Success depends as much on the contract as on the play. The difficulty in bidding has resulted in the development of strategies for bidding. In this paper, we model the opening strategies based on variations of precision and Standard American. The language of logic PS+ is used for encoding data and defining the rules for the bridge opening program. We take advantage of the nonmonotonic properties of the language of logic PS+ to model contract bridge openings. The aspps system consists of two modules: psgrnd (for grounding a problem definition with the data of an instance of the problem) and the aspps solver. We show that the aspps system generates answer--sets for our bridge opening program where each answer--set is an opening bid.en_US
dc.formatText
dc.format.extent7 pages
dc.format.medium1 file (.pdf)
dc.language.isoen_US
dc.subjectNonmonotonic logicen_US
dc.subjectAnswer-set programmingen_US
dc.subjectLogic programmingen_US
dc.subjectConstraint satisfactionen_US
dc.subjectContract bridgeen_US
dc.subjectBidding strategiesen_US
dc.titleModeling Contract Bridge Bid Opening Strategies using the aspps Systemen_US
txstate.documenttypeTechnical Report
txstate.departmentComputer Science


Download

Thumbnail

This item appears in the following Collection(s)

Show simple item record