Ines Lynce
Ines Lynce

homepage
inesatsat.inesc-id.pt

Professional ACM Member badge
  Affiliation history
Bibliometrics: publication history
Average citations per article6.20
Citation Count335
Publication count54
Publication years2001-2014
Available for download1
Average downloads per article249.00
Downloads (cumulative)249
Downloads (12 Months)24
Downloads (6 Weeks)6
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


51 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 51
Result page: 1 2 3

Sort by:

1
November 2014 Artificial Intelligence: Volume 216 Issue 1, November 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

Knowledge representation and reasoning using propositional logic is an important component of AI systems. A propositional formula in Conjunctive Normal Form (CNF) may contain redundant clauses — clauses whose removal from the formula does not affect the set of its models. Identification of redundant clauses is important because redundancy often ...
Keywords: minimal unsatisfiability, redundancy, boolean satisfiability, irredundant subformula

2
July 2013 SAT'13: Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Unsatisfiability-based algorithms for Maximum Satisfiability (MaxSAT) have been shown to be very effective in solving several classes of problem instances. These algorithms rely on successive calls to a SAT solver, where an unsatisfiable subformula is identified at each iteration. However, in some cases, the SAT solver returns unnecessarily large subformulas. ...

3
August 2012 ECAI'12: Proceedings of the 20th European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

Partitioning formulas is motivated by the expectation to identify easy to solve subformulas, even though at the cost of having more formulas to solve. In this paper we suggest to apply partitioning to Maximum Satisfiability (MaxSAT), the optimization version of the well-known Satisfiability (SAT) problem. The use of partitions can ...

4
July 2012 Constraints: Volume 17 Issue 3, July 2012
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 7

Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there are still many challenging problems for SAT solvers. Nowadays, extra computational power is no longer coming from higher processor frequencies. At the same time, multicore architectures are becoming predominant. Exploiting this new architecture is essential for the evolution ...
Keywords: Boolean satisfiability (SAT), Parallel search

5
January 2012 LION 6: Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In parallel MaxSAT solving, sharing learned clauses is expected to help to further prune the search space and boost the performance of a parallel solver. However, not all learned clauses should be shared since it could lead to an exponential blow up in memory and to sharing many irrelevant clauses. ...

6
November 2011 ICTAI '11: Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7

Cardinality constraints appear in many practical problems and have been well studied in the past. There are many CNF encodings for cardinality constraints, although it is not clear which encodings perform better. Indeed, different encodings can perform well over different problems. This paper examines a large number of cardinality encodings ...
Keywords: Parallel Search, Maximum Satisfiability, Cardinality Encodings

7
July 2011 Annals of Mathematics and Artificial Intelligence: Volume 62 Issue 3-4, July 2011
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 14

Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for ...
Keywords: 90C29, Boolean optimization, 90C27, Maximum satisfiability, Haplotyping with pedigrees, Pseudo-Boolean optimization, Software package dependencies, 68T20, Lexicographic optimization

8
June 2011 SAT'11: Proceedings of the 14th international conference on Theory and application of satisfiability testing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 22

Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical applications, including product configuration, knowledge-based validation, and hardware and software design and verification. MUSes also find application in recentMaximum Satisfiability algorithms and in CNF formula redundancy removal. Besides direct applications in Propositional Logic, algorithms for MUS extraction have been applied ...

9
April 2011 Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion: Volume 107 Issue 2-3, April 2011
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

The extraction of a Minimal Unsatisfiable Core (MUC) in a Constraint Satisfaction Problem (CSP) aims to identify a subset of constraints that make a CSP instance unsatisfiable. Recent work has addressed the identification of a Minimal Set of Unsatisfiable Tuples (MUST) in order to restore the CSP satisfiability with respect ...
Keywords: maximum satisfiability, minimal unsatisfiable cores, constraint satisfaction problems, minimal set of unsatisfiable tuples

10
October 2010 ICTAI '10: Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

The last two decades progresses have led Propositional Satisfiability (SAT) to be a competitive practical approach to solve a wide range of industrial and academic problems. Thanks to these advances, the size and difficulty of the SAT instances have grown significantly. The demand for more computational power led to the ...

11 published by ACM
September 2010 ASE '10: Proceedings of the IEEE/ACM international conference on Automated software engineering
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 6,   Downloads (12 Months): 24,   Downloads (Overall): 249

Full text available: PDFPDF
The installation of software packages depends on the correct resolution of dependencies and conflicts between packages. This problem is NP-complete and, as expected, is a hard task. Moreover, today's technology still does not address this problem in an acceptable way. This paper introduces a new approach to solving the software ...
Keywords: meta-installer, dependencies solving, pseudo-boolean optimization, component management

12
August 2010 Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 10

Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreover, backbones find other applications. For example, backbones are often identified during product configuration. Backbones can also improve the efficiency of solving computational problems related ...

13
July 2010 ANB'10: Proceedings of the 4th international conference on Algebraic and Numeric Biology
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

Existing genotyping technologies have enabled researchers to genotype hundreds of thousands of SNPs efficiently and inexpensively. Methods for the imputation of non-genotyped SNPs and the inference of haplotype information from genotypes, however, remain important, since they have the potential to increase the power of statistical association tests. In many cases, ...
Keywords: Boolean optimization, haplotype inference

14
July 2010 SAT'10: Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 14

In this paper we report about QBFEVAL’10, the seventh in a series of events established with the aim of assessing the advancements in reasoning about quantified Boolean formulas (QBFs). The paper discusses the results obtained and the experimental setup, from the criteria used to select QBF instances to the evaluation ...

15
July 2010 SAT'10: Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 10

Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfiability (MaxSAT) and other Boolean Optimization problems. These algorithms are based on being able to iteratively identify and relax unsatisfiable sub-formulas with the use of fast Boolean satisfiability solvers. It has been shown that this approach is very effective for several ...

16
May 2010 ISMVL '10: Proceedings of the 2010 40th IEEE International Symposium on Multiple-Valued Logic
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We analyze the existing encodings from MaxCSP into Partial MaxSAT, and report on a number of new insights that we have gained from our analysis, which can be summarized as follows: (i) the at-most-one (AMO) condition can be omitted in direct encodings from MaxCSP into Partial MaxSAT, and auxiliary variables ...
Keywords: Encodings, MaxCSP, Partial MaxSAT

17
December 2009 Constraints: Volume 14 Issue 4, December 2009
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 11

Explaining the causes of infeasibility of Boolean formulas has practical applications in numerous fields, such as artificial intelligence (repairing inconsistent knowledge bases), formal verification (abstraction refinement and unbounded model checking), and electronic design (diagnosing and correcting infeasibility). Minimal unsatisfiable subformulas (MUSes) provide useful insights into the causes of infeasibility. An ...
Keywords: SMUS, Boolean satisfiability, Infeasibility, MUS, Minimal unsatisfiable subformula, SAT, Smallest minimal unsatisfiable subformula

18
September 2009 RECOMB-CG '09: Proceedings of the International Workshop on Comparative Genomics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The increasing number of fully sequenced genomes has led to the study of genome rearrangements. Several approaches have been proposed to solve this problem, all of them being either too complex to be solved efficiently or too simple to be applied to genomes of complex organisms. The latest challenge has ...

19
July 2009 IJCAI'09: Proceedings of the 21st international jont conference on Artifical intelligence
Publisher: Morgan Kaufmann Publishers Inc.
Bibliometrics:
Citation Count: 8

Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each individual optimization problem, such that the solution of the resulting aggregated optimization problem solves the original set of optimization problems. This paper starts by studying ...

20
June 2009 SAT '09: Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We define new encodings from Max-CSP into Partial Max-SAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality constraint ≤ 1 (<em>x</em> 1 , ...,<em>x</em> <em>n</em> ). They have fewer clauses than the existing encodings, and the experimental results indicate that they have ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us