Filters








225,373 Hits in 3.8 sec

The complexity of counting locally maximal satisfying assignments of Boolean CSPs

Leslie Ann Goldberg, Mark Jerrum
2016 Theoretical Computer Science  
For each constraint language Gamma, #MaximalCSP(Gamma) denotes the problem of counting the maximal satisfying assignments, given an input CSP with constraints in Gamma.  ...  We investigate the computational complexity of the problem of counting the maximal satisfying assignments of a Constraint Satisfaction Problem (CSP) over the Boolean domain 0,1.  ...  The computational complexity of the satisfiability problem depends, of course, on the constraint language Γ, becoming potentially harder as Γ becomes larger and more expressive.  ... 
doi:10.1016/j.tcs.2016.04.008 fatcat:t25emvz2sbapxbj75gg7bcsfia

Maximal infinite-valued constraint languages

Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2009 Theoretical Computer Science  
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain.  ...  In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains.  ...  Therefore, all maximal constraint languages of unknown computational complexity are preserved by an essential binary operation.  ... 
doi:10.1016/j.tcs.2008.12.050 fatcat:ummvid5kzzbibdemof3zhfkf7a

Maximal Infinite-Valued Constraint Languages [chapter]

Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2007 Lecture Notes in Computer Science  
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain.  ...  In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains.  ...  Therefore, all maximal constraint languages of unknown computational complexity are preserved by an essential binary operation.  ... 
doi:10.1007/978-3-540-73420-8_48 fatcat:fxuswamvonc6pm725wbezy6uqy

Violation of Onset Constraint in Word-Initial Syllable (Analysis in English and Lithuanian)

Edita Katinaitė-Kalčiūnienė
2015 Žmogus ir Žodis  
Accordingly, ONSET constraint in Lithuanian may prove to be occupying a higher position in the constraint hierarchy of the Lithuanian language.  ...  The results of the investigation have shown that the Lithuanian language exhibits fewer cases of ONSET violations in word-initial syllable than the English language.  ...  Onset in English word-initial syllables Th e Lithuanian language (table 2, chart 2), on the other hand, exhibits fewer instances of violations of ONSET constraint than the English language, thus has maximal  ... 
doi:10.15823/zz.2015.11 fatcat:ffxqswjjsnadnkzx77kuoayq5q

Optimality: From Neural Networks to Universal Grammar

A. Prince, P. Smolensky
1997 Science  
questions of linguistic theory: What is it that the grammars of all languages share, and how may they differ?  ...  The proposition that grammaticality equals optimality sheds light on a wide range of phenomena, from the gulf between production and comprehension in child language, to language learnability, to the fundamental  ...  constraints, which favor exact replication of the input, even at the cost of structural complexity.  ... 
doi:10.1126/science.275.5306.1604 pmid:9054349 fatcat:zlbdqn5wprdizm7g33xdwgvdja

Queries with incomplete answers over semistructured data

Yaron Kanza, Werner Nutt, Yehoshua Sagiv
1999 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '99  
Acknowledgments This research was supported in part by the Esprit Long Term Research Project 22469 "Foundations of Data Warehouse Quality" (DWQ), and by Grants 8528-95-1 and 9481-1-98 of the Israeli Ministry  ...  of Science.  ...  We describe a polynomial algorithm for evaluating a special type of queries with filter constraints and assess the complexity of evaluating other queries for several kinds of constraints.  ... 
doi:10.1145/303976.303999 dblp:conf/pods/KanzaNS99 fatcat:qaayjlqspjfi5a3jesez7ah2b4

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection [chapter]

David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Živný
2011 Lecture Notes in Computer Science  
The complexity of any optimisation problem depends critically on the form of the objective function.  ...  We show in this paper that when the costs are non-negative rational numbers or infinite, then the complexity of a valued constraint problem is determined by certain algebraic properties of this valued  ...  has shown that fractional polymorphisms capture the complexity of valued constraint languages.  ... 
doi:10.1007/978-3-642-22993-0_23 fatcat:n2lvea2ckfbypiho2kckod3xkq

MAX ONES Generalized to Larger Domains

Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
2008 SIAM journal on computing (Print)  
We present two main results: a complete classification for the approximability of all maximal constraint languages over domains of cardinality at most 4, and a complete classification of the approximability  ...  Under the assumption that a conjecture due to Szczepara holds, we give a complete classification for all maximal constraint languages.  ...  The authors would like to thank the anonymous referees for many valuable comments and in particular for pointing out a serious flaw in the (previous) proof of Lemma 6.14.  ... 
doi:10.1137/060669231 fatcat:ydopustiorgxtn52vjwl37ydmy

Approximability of Integer Programming with Generalised Constraints [article]

Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
2008 arXiv   pre-print
We present two main results: a complete classification for the approximability of all maximal constraint languages over domains of cardinality at most 4, and a complete classification of the approximability  ...  Under the assumption that a conjecture due to Szczepara holds, we give a complete classification for all maximal constraint languages.  ...  Acknowledgements The authors would like to thank the anonymous referees for many valuable comments and in particular for pointing out a serious flaw in the (previous) proof of Lemma 6.14.  ... 
arXiv:cs/0602047v3 fatcat:z7nmwfd4izhmno7goougt3w5c4

Learning metathesis: Evidence for syllable structure constraints

Sara Finley
2017 Journal of Memory and Language  
One of the major questions in the cognitive science of language is whether the perceptual and phonological motivations for the rules and patterns that govern the sounds of language are a part of the psychological  ...  This question is particularly important in the study of phonological patterns -systematic constraints on the representation of sounds, because phonological patterns tend to be grounded in phonetic constraints  ...  the Northwestern Phonatics group and the University of Rochester Aslin-Newport lab, as well as participants at the 2014 LAGB workshop.  ... 
doi:10.1016/j.jml.2016.06.005 pmid:28082764 pmcid:PMC5222580 fatcat:w57usflfdradpmvne4rpblrjge

New Version-Space Representations for Efficient Instance Retraction

Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H. Jaap van den Herik
2002 International Workshop on Knowledge Discovery in Inductive Databases  
They are correct representations for the class of admissible concept languages and are efficiently computable.  ...  In this paper, two new version-space representations are introduced: instance-based maximal boundary sets and instancebased minimal boundary sets.  ...  The Worst-Case Complexity Analysis The worst-case complexity analysis is made in terms of the computational characteristics of admissible concept languages.  ... 
dblp:conf/kdid/SmirnovSH02 fatcat:suyikactfvbzbppykwcx3aeslq

Approximability of Integer Programming with Generalised Constraints [chapter]

Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
2006 Lecture Notes in Computer Science  
We present two main results: a complete classi cation for the approximability of all maximal constraint languages over domains of cardinality at most 4, and a complete classi cation of the approximability  ...  Under the assumption that a conjecture due to Szczepara holds, we give a complete classi cation for all maximal constraint languages.  ...  Acknowledgements The authors would like to thank the anonymous referees for many valuable comments and in particular for pointing out a serious aw in the (previous) proof of Lemma 6.  ... 
doi:10.1007/11889205_20 fatcat:o7gqbx2hyra3hdrg3pkzqul7qq

Deriving Reduplicants in Prosodic-Morphology Typologies

Natalie DelBusso
2016 Proceedings of the Annual Meetings on Phonology  
Reduplicative morphemes often take the shape of the prosodic units syllable, foot, or prosodic word, regardless of the size of the base to which they attach.  ...  size.In this study, I determine the assumptions that are required to produce uniform reduplicative paradigms with the three basic types, syllable, foot and total, from the interaction of constraints in  ...  It assigns the same number of violations regardless of the morphological complexity of the candidate.  ... 
doi:10.3765/amp.v2i0.3074 fatcat:nhwfd5ey5nhh3n7lg2luqvzfva

The expressive rate of constraints

Hubie Chen
2005 Annals of Mathematics and Artificial Intelligence  
We study a simple measure of expressiveness: the number of formulas expressible by a language, up to semantic equivalence. We prove a dichotomy theorem on constraint languages regarding this measure.  ...  In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity.  ...  that has been used to study the complexity of the CSP [7, 4] .  ... 
doi:10.1007/s10472-005-7031-4 fatcat:dncht3cfcvgk5lsicnwxo6dtjq

Computational complexity of linear constraints over the integers

Peter Jonsson, Tomas Lööw
2013 Artificial Intelligence  
The computational complexity of continuous-time temporal constraint reasoning is fairly well understood.  ...  We show that the full formalism is NP-hard and identify several maximal tractable subclasses. We also 'lift' the maximality results to obtain hardness results for other families of constraints.  ...  Acknowledgements Peter Jonsson is partially supported by the Swedish Research Council (VR) under grant 621-2009-4431, and Tomas Lööw is partially supported by the Swedish National Graduate School in Computer  ... 
doi:10.1016/j.artint.2012.10.001 fatcat:44i5loope5hvfefnyporhmuuay
« Previous Showing results 1 — 15 out of 225,373 results