The complexity of minimal inference problem for conservative constraint languages

2019
journal article
article
dc.affiliationWydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznejpl
dc.contributor.authorWrona, Michał - 363255 pl
dc.date.accessioned2019-04-09T17:28:57Z
dc.date.available2019-04-09T17:28:57Z
dc.date.issued2019pl
dc.description.number2pl
dc.description.volume20pl
dc.identifier.articleid8pl
dc.identifier.doi10.1145/3301410pl
dc.identifier.eissn1557-945Xpl
dc.identifier.issn1529-3785pl
dc.identifier.project014/14/A/ST6/00138pl
dc.identifier.projectROD UJ / Opl
dc.identifier.urihttps://ruj.uj.edu.pl/xmlui/handle/item/72612
dc.languageengpl
dc.language.containerengpl
dc.rightsDodaję tylko opis bibliograficzny*
dc.rights.licencebez licencji
dc.rights.uri*
dc.subtypeArticlepl
dc.titleThe complexity of minimal inference problem for conservative constraint languagespl
dc.title.journalACM Transactions on Computational Logicpl
dc.typeJournalArticlepl
dspace.entity.typePublication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
0
Views per month

No access

No Thumbnail Available