Filters








79,186 Hits in 4.4 sec

A Cardinality Solver: More Expressive Constraints for Free [chapter]

Mark H. Liffiton, Jordyn C. Maglalang
2012 Lecture Notes in Computer Science  
The first is to more completely evaluate the performance of MiniCARD relative to other means of solving cardinality constraints, especially SAT solvers with preprocessing.  ...  Asín, et al. [1] evaluated an "SMT-based approach" to cardinality constraints that solved them without encoding them to CNF.  ...  The first is to more completely evaluate the performance of MiniCARD relative to other means of solving cardinality constraints, especially SAT solvers with preprocessing.  ... 
doi:10.1007/978-3-642-31612-8_47 fatcat:bjfg25iv5jdcflpjbb5ovhqowm

Generating Queries with Cardinality Constraints for DBMS Testing

N. Bruno, S. Chaudhuri, D. Thomas
2006 IEEE Transactions on Knowledge and Data Engineering  
Specifically, obtaining query instances that satisfy cardinality constraints on their sub-expressions is an important challenge.  ...  Good testing coverage of novel database techniques, such as multidimensional histograms or changes in the execution engine, is a complex problem.  ...  EXPERIMENTAL EVALUATION We next report an experimental evaluation of our technique of Section V to generate queries with cardinality constraints.  ... 
doi:10.1109/tkde.2006.190 fatcat:7xljr2ny2vawbl3u5c3kj5qe6u

Embedding cardinality constraints in neural link predictors

Emir Muñoz, Pasquale Minervini, Matthias Nickles
2019 Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing - SAC '19  
In this paper, we propose a new regularisation approach to incorporate relation cardinality constraints to any existing neural link predictor without affecting their efficiency or scalability.  ...  A fundamental aspect of the topology of relational data is the cardinality information, which bounds the number of predictions given for a relation between a minimum and maximum frequency.  ...  ., Japan and Insight Centre for Data Analytics at National University of Ireland Galway (supported by the Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/2289).  ... 
doi:10.1145/3297280.3297502 dblp:conf/sac/MunozMN19 fatcat:o6lsas5ge5h2tghybe25eu7gzq

On Formalization of Extended Feature Model using Promotion Technique in Z

Shohreh Ajoudanian, Seyed-Hassan Mirian Hosseinabadi
2015 Indian Journal of Science and Technology  
constraint.  ...  Objectives: To investigate automatic analysis of extended feature model with cardinality. Methods/Analysis: Presenting a formal approach to the specification of Ext-FM-WC.  ...  rwff1 requires complex constraint rwff2, e.g., if rwff1 is in a product, rwff2 must be in the product too. • Excludes (rwff1, rwff2) means that complex constraint rwff1 excludes the existence of complex  ... 
doi:10.17485/ijst/2015/v8i17/55613 fatcat:4lvn5jqtabexdoxkbvido2km3u

QMaxSAT: A Partial Max-SAT Solver

Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa
2012 Journal on Satisfiability, Boolean Modeling and Computation  
We present a partial Max-SAT solver QMaxSAT which uses CNF encoding of Boolean cardinality constraints.  ...  The old version 0.1 was obtained by adapting a CDCL based SAT solver MiniSat to manage cardinality constraints.  ...  There are several CNF encodings of cardinality constraints with better space complexity than that of version 0.1.  ... 
doi:10.3233/sat190091 fatcat:6s3g57kogffhdnld5dnl6jhtfa

Cardinality Abstraction for Declarative Networking Applications [chapter]

Juan Antonio Navarro Pérez, Andrey Rybalchenko, Atul Singh
2009 Lecture Notes in Computer Science  
Our cardinality abstraction-based verifier successfully proves critical safety properties of a P2 implementation of the Byzantine fault tolerance protocol Zyzzyva, which is a representative and complex  ...  In this paper, we propose a cardinality abstraction technique that can be used to analyze and verify P2 programs.  ...  We present examples of cardinality measures and their evaluation wrt. S below.  ... 
doi:10.1007/978-3-642-02658-4_43 fatcat:t3sxwsdiojdvrb2clfog4gs5mm

Applying a Fuzzy Approach to Relaxing Cardinality Constraints [chapter]

Harith T. Al-Jumaily, Dolores Cuadra, Paloma Martínez
2004 Lecture Notes in Computer Science  
In this paper a method to reducing and simplifying the complex verification of cardinality constraints by relaxing these constraints using fuzzy concepts is proposed.  ...  In database applications the verification of cardinality constraints is a serious and complex problem that appears when the modifications operations are performed in a large cascade.  ...  The final objective is to simplify the complex implementation of verifying cardinality constraints.  ... 
doi:10.1007/978-3-540-30075-5_63 fatcat:mo5m5c3ujzed3l2wjrhpz4lsme

Evaluation of set-based queries with aggregation constraints

Quoc Trung Tran, Chee-Yong Chan, Guoping Wang
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
We first establish the hardness of evaluating SAC queries with multiple count constraints and presented a novel, pseudo-polynomial time algorithm for evaluating a non-trivial fragment of SAC queries with  ...  multiple sum constraints and at most one of either count, group-by, or content constraint.  ...  This raises the interesting open question of what is the complexity of evaluating SAC queries with more than one count constraint or SAC queries with a combination of sum and count constraints.  ... 
doi:10.1145/2063576.2063791 dblp:conf/cikm/TranCW11 fatcat:svnlsoy5f5gcbmhgig6lencu7i

Consistency checking for the evolution of cardinality-based feature models

Clément Quinton, Andreas Pleuss, Daniel Le Berre, Laurence Duchien, Goetz Botterweck
2014 Proceedings of the 18th International Software Product Line Conference on - SPLC '14  
In practice, fm configuration can be a complex task due to size and complexity of fms [23] .  ...  Our empirical evaluation showed that our approach checks the consistency of large cardinality-based fms (2000 features) in a reasonable time compared to their related combinatorial complexity, due to our  ... 
doi:10.1145/2648511.2648524 dblp:conf/splc/QuintonPBDB14 fatcat:a2hkpw5wyvg6dhzcrflyva7hxi

Conflict Directed Lazy Decomposition [chapter]

Ignasi Abío, Peter J. Stuckey
2012 Lecture Notes in Computer Science  
Two competing approaches to handling complex constraints in satisfaction and optimization problems using SAT and LCG/SMT technology are: decompose the complex constraint into a set of clauses; or (theory  ...  In this paper we show how we can obtain the best of both worlds by lazily decomposing a complex constraint propagator using conflicts to direct it.  ...  NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre of Excellence  ... 
doi:10.1007/978-3-642-33558-7_8 fatcat:otqdiowp5bgy5bvu7k44bgu4ce

Statistical Learning with a Nuisance Component (Extended Abstract)

Dylan J. Foster, Vasilis Syrgkanis
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We provide excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate a target parameter depends on an unknown parameter that must be estimated  ...  Moreover, by focusing on excess risk rather than parameter estimation, we can give guarantees under weaker assumptions than in previous works and accommodate the case where the target parameter belongs to a complex  ...  Acknowledgments This work was supported in part by the National Key R&D Program of China (No. 2018YFB1403001).  ... 
doi:10.24963/ijcai.2020/646 dblp:conf/ijcai/ZhuZWLZ20 fatcat:yjsycfoqxjdz3cll4litqbxlmq

Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints [chapter]

Peter Revesz
2004 Lecture Notes in Computer Science  
We also explain the connection of this new logical result with the evaluation of relational calculus queries on constraint databases that contain Boolean linear cardinality constraints.  ...  We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm.  ...  Acknowledgment: I thank the conference organizers, especially András Benczur, for encouraging submission of this paper.  ... 
doi:10.1007/978-3-540-30204-9_1 fatcat:4jaji3a2pjcfbit3suhp3jq3jm

An analysis of the structural validity of ternary relationships in entity relationship modeling

James Dullea, Ii-Yeol Song
1998 Proceedings of the seventh international conference on Information and knowledge management - CIKM '98  
These rules can be readily applied to real world models regardless of the complexity of the problem.  ...  Here we use both maximum and minimum cardinality constraints yielding a more complete analysis of the structural validity of ternary relationship types.  ...  We believe that this analysis is a completed effort and can be readily implemented in its current form providing an adequate foundation for the evaluation of structural validity in entity relationship  ... 
doi:10.1145/288627.288674 dblp:conf/cikm/DulleaS98 fatcat:cbqb4d5qtfbchfx2eyzco5dv4m

Adding Temporal Constraints to XML Schema

Faiz A. Currim, Sabah A. Currim, Curtis E. Dyreson, Richard T. Snodgrass, Stephen W. Thomas, Rui Zhang
2012 IEEE Transactions on Knowledge and Data Engineering  
If past versions of XML documents are retained, what of the various integrity constraints defined in XML Schema on those documents?  ...  This paper describes how to interpret such constraints as sequenced constraints, applicable at each point in time.  ...  The complexity of Algorithm 3 is determined primarily by the number of evaluation windows l as well as the complexity of Algorithm 4, and is thus O(l · n · m).  ... 
doi:10.1109/tkde.2011.74 fatcat:jg7pxybavrd3rc66osjtlslfv4

Evaluation of Cardinality Constraints on SMT-Based Debugging

Andre Sülflow, Robert Wille, Görschwin Fey, Rolf Drechsler
2009 2009 39th International Symposium on Multiple-Valued Logic  
The experimental evaluation on debugging instances that contain cardinality constraints shows the strong influence of the encoding on the resulting run-times.  ...  In this work, encodings for cardinality constraints in SMT are investigated.  ...  Conclusion In this work, we evaluated encodings for cardinality constraints in the context of SMT-based debugging.  ... 
doi:10.1109/ismvl.2009.28 dblp:conf/ismvl/SulflowWFD09 fatcat:ooyoeic6m5eelo3dowil5udnwy
« Previous Showing results 1 — 15 out of 79,186 results