Map generation by co-operative autonomous robots using possibility theory.
STUDIES IN FUZZINESS AND SOFT COMPUTING: Fuzzy Logic Techniques for Autonomous Vehicle Navigation.. :281-312.
Exploiting moral values to choose the right norms.
AAAI/ACM Conference on Artificial Intelligence, Ethics and Society.
Multiagent based simulation on news digital markets.
International journal of computer science and applications.. 2:7-14.
Automating decision making to help establish norm-based regulations.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. :1613-1615.
Case-based Learning on Strategic Knowledge.
Lecture Notes in Artificial Intelligence. 482:398-411.
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
EvoCOP 2017 -- 17th European Conference on Evolutionary Computation in Combinatorial Optimization. 10197 (Lecture Notes in Computer Science):60--74.
Exact MinSAT Solving.
International Conference on Theory and Applications of Satisfiability Testing (SAT). 6175:363-368.
New Inference Rules for Max-SAT.
Journal of Artificial Intelligence Research. 30:321-359.
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT.
Proceedings of the 21st National Conference on Artificial Intelligence, AAAI-2006, Boston/MA, USA. :86-91.
Exploiting Cycle Structures in Max-SAT.
12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). 5584:467-480.
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation.
14th International Conference on Principles and Practice of Constraint Programming (CP-2008). 5202:582-587.
MaxSAT, Hard and Soft Constraints.
Handbook of Satisfiability. 185:613-631.
Minimum Satisfiability and Its Applications.
22nd International Joint Conference on Artificial Intelligence, IJCAI 2011. :605-610.
Monadic Second-Order Unifications is NP Complete.
Lecture Notes in Computer Science. 3091:55-69.
Stratified Context Unification is NP-complete.
Lecture Notes in Computer Science. 4130:82-96.
Linear Second Order Unification.
Lecture Notes in Computer Science. 1103:332-346.
Bounded Second-Order Unification Is NP-Complete.
Lecture Notes in Computer Science. 4098:400-414.