Export 59 results:
[ Author(Desc)] Title Type Year
Filters: First Letter Of Last Name is L  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
L
Lacostena JRoca, Cerquides J.  2013.  Generalizing Semiring induced Valuation Algebras. :40.
Ladra S, Torra V.  2008.  On the comparison of generic information loss measures and cluster-specific ones. Int. J. of Unc., Fuzziness and Knowledge Based Systems. 16:107-120.
Ladra S, Torra V.  2010.  Information loss for synthetic data through fuzzy clustering. Int. J. of Uncertainty, Fuzziness and Knowledge-Based Systems. 18:25-37.
Lamontagne L, Plaza E.  2014.  Case-Based Reasoning Research and Development - Proc. ICCBR-14. 8765
Larrosa J, Meseguer P.  2002.  Partition-Based Lower Bound for Max-CSP. Constraints Journal. 7:407-419.
Larrosa J, Meseguer P, Sánchez M.  2002.  Pseudo-Tree Search with Soft Constraints. Proceedings of the 15th European Conference on Artificial Intelligence, ECAI-02. :131-135.
Larrosa J, Meseguer P.  2003.  Restricciones blandas : Modelos y Algoritmos. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial. Otoño/2003:69-81.
Larrosa J, Meseguer P.  2003.  Algoritmos para satisfacción de Restricciones. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial. Otoño 2003:31-42.
Larrosa J, Meseguer P.  1995.  Optimization-based heuristics for maximal constraint satisfaction. Lecture notes in computer science. 976:103-120.
Lemaitre C, Noriega P.  2016.  Characterising Polemical Disputes. 4TH INTERNATIONAL CONFERENCE ON AGREEMENT TECHNOLOGIES .
Lemaitre C, Noriega P.  2015.  Making sense out of polemics. Twelfth International Workshop on Argumentation in Multi-Agent Systems (ArgMAS 2015).
Levy J, Schmidt-Schauss M, Villaret M.  2009.  On the Complexity of Bounded Second-order Unification and Stratified Context Unification. Journal of Algorithms in Cognition, Informatics, and Logic.
Levy J, Schmidt-Schauss M, Villaret M.  2006.  Stratified Context Unification is NP-complete. Lecture Notes in Computer Science. 4130:82-96.
Levy J, Agustí-Cullell J.  1996.  Bi-Rewrite Systems. Journal of Symbolic Computation. 22:279–314.
Levy J, Villaret M.  2002.  Currying Second-Order Unification Problems. Lecture Notes in Computer Science. 2378:326-339.
Levy J.  1996.  Linear Second Order Unification. Lecture Notes in Computer Science. 1103:332-346.
Levy J, Schmidt-Schauss M, Villaret M.  2006.  Bounded Second-Order Unification Is NP-Complete. Lecture Notes in Computer Science. 4098:400-414.
Levy J, Villaret M.  2010.  An Efficient Nominal Unification Algorithm. Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010. :209-226.
Levy J, Veanes M.  2000.  On the Undecidability of Second-Order Unification. Information and Computation. 159:125–150.
Levy J, Schmidt-Schauss M, Villaret M.  2011.  On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Logic Journal of the IGPL. 19:763-789.
Levy J, Villaret M.  2008.  Nominal Unification from a Higher-Order Perspective. Proc. of the 19th International Conference on Rewriting Techniques and Applications, RTA'08. 5117:246-260.
Levy J, Schmidt-Schauss M, Villaret M.  2008.  The Complexity of Monadic Second-Order Unification. SIAM Journal on Computing. 38:1113-1140.
Levy J, Villaret M.  2012.  Nominal Unification from a Higher-Order Perspective. ACM Transactions on Computational Logics. 13:10.
Levy J, Schmidt-Schauss M, Villaret M.  2004.  Monadic Second-Order Unifications is NP Complete. Lecture Notes in Computer Science. 3091:55-69.
Levy J, Niehren J, Villaret M.  2005.  Well-Nested Context Unification. Lecture Notes in Artificial Intelligence. 3632:149-163.
Levy J.  1998.  Decidable and Undecidable Second-Order Unification Problems. Lecture Notes in Computer Science. 1379:47-60.
Levy J.  1994.  The Calculus of Refinements, a Formal Specification Model Based on Inclusions. Universitat Politècnica de Catalunya.
Levy J, Villaret M.  2009.  Simplifying the Signature in Second-Order Unification. Applicable Algebra in Engineering, Communication and Computing. 20:427-445.
Levy J, Villaret M.  2000.  Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. Lecture Notes in Computer Science. 1833:156-171.
Levy J, Agustí-Cullell J.  1992.  Implementing Inequality and Nondeterministic Specifications with Bi-rewriting Systems. Lecture Notes in Computer Science. 785:252-267.
Levy J, Veanes M.  1998.  On Unification Problems in Restricted Second-Order Languages. Annual Conference of the European Association for Computer Science Logic, CSL'98.
Levy J, Agustí-Cullell J.  1993.  Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations. Proc. of the 5th Int. Conf. on Rewriting Techniques and Applications, RTA'93.
Levy J, Villaret M.  2001.  Context unification and Traversal Equations. Lecture Notes in Computer Science. 2051:169-184.
Li CMin, Manyà F, Planes J.  2007.  New Inference Rules for Max-SAT. Journal of Artificial Intelligence Research. 30:321-359.
Li CMin, Manyà F, Mohamedou NO, Planes J.  2008.  Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. 14th International Conference on Principles and Practice of Constraint Programming (CP-2008). 5202:582-587.
Li CMin, Manyà F, Mohamedou NOuld, Planes J.  2010.  Resolution-Based Lower Bounds in MaxSAT. Constraints. 15:29.
Li CMin, Manyà F.  2009.  MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability. 185:613-631.
Li CMin, Manyà F, Quan Z, Zhu Z.  2010.  Exact MinSAT Solving. International Conference on Theory and Applications of Satisfiability Testing (SAT). 6175:363-368.
Li CMin, Manyà F, Mohamedou NOuld, Planes J.  2009.  Exploiting Cycle Structures in Max-SAT. 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). 5584:467-480.
Li CMin, Zhu Z, Manyà F, Simon L.  2011.  Minimum Satisfiability and Its Applications. 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011. :605-610.
Li CMin, Zhu Z, Manyà F, Simon L.  2012.  Optimizing with minimum satisfiability. Artificial intelligence. 190:32-44.
Li CMin, Manyà F, Planes J..  2005.  Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max SAT Solvers. Lecture Notes in Computer Science. 3571:403-414.
Li CMin, Manyà F, Planes J..  2006.  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.
Lizárraga E, Blesa MJ, Blum C.  2017.  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.
Lizárraga E, Blesa MJ, Blum C.  2017.  On the comparison of CMSA versus LNS for solving Combinatorial Optimization problems with different solution sizes. Metaheuristics International Conference (MIC). :676-678.
Lizárraga E, Blesa MJ, Blum C, Raidl GR.  2017.  Large neighborhood search for the most strings with few bad columns problem. Soft Computing. 21(17):4901–4915.
López B, Plaza E.  1997.  Case-based learning of plans and goal states in medical diagnosis. Artificial Intelligence in Medicine. 9:29-60.
López B, Plaza E.  1991.  Case-based Learning on Strategic Knowledge. Lecture Notes in Artificial Intelligence. 482:398-411.
López B, Meseguer P, Plaza E.  1990.  Knowledge -Based Systems Validation: A State of the Art. AI Communications. 3:58-72.
López-Sánchez M, de Mántaras RLópez, Sierra C.  1998.  Possibility theory-based environment modelling by means of behaviour-based autonomous robots. European Conference on Artificial Intelligence. ECAI 98. :222-229.