Now showing items 1-20 of 33

    • A Max-SAT Solver with Lazy Data Structures 

      Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2004)
      We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. We provide experimental evidence that ...
    • Adding truth-constants to logics of continuous t-norms: Axiomatization and completeness results 

      Noguera, Carles; Esteva, Francesc; Gispert, Joan; Godó, Lluís (Elsevier, 2007)
      In this paper we study generic expansions of logics of continuous t-norms with truth-constants, taking advantage of previous results for Łukasiewicz logic and more recent results for Gödel and Product logics. Indeed, we ...
    • An Argument-Based Framework to Model an Agent’s Beliefs in a Dynamic Environment 

      Capobianco, Marcela; Chesñevar, Carlos Iván; Simari, Guillermo Ricardo (Springer Verlag, 2005)
      One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’s current knowledge about the world, and consequently ...
    • An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships 

      Alsinet, Teresa; Argelich Romà, Josep; Béjar Torres, Ramón; Fernàndez Camon, César; Mateu Piñol, Carles; Planes Cid, Jordi (Elsevier, 2017-07-08)
      Twitter is one of the most widely used social networks when it comes to sharing and criticizing relevant news and events. In order to understand the major opinions accepted and rejected in different domains by Twitter ...
    • Argument-based critics and recommenders: A qualitative perspective on user support systems 

      Chesñevar, Carlos Iván; Maguitman, Ana Gabriela; Simari, Guillermo Ricardo (Elsevier, 2006)
      In recent years we have witnessed the wide-spread evolution of support tools that operate in association with the user to accomplish a range of computer-mediated tasks. Two examples of these tools are critics and recommenders. ...
    • Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties 

      Chesñevar, Carlos Iván; Simari, Guillermo Ricardo; Godo i Lacasa, Lluís; Alsinet, Teresa (Springer Verlag, 2005)
      Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty ...
    • Argumentation and the Dynamics of Warranted Beliefs in Changing Environments 

      Capobianco, Marcela; Chesñevar, Carlos Iván; Simari, Guillermo Ricardo (Springer Verlag, 2005)
      One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New perceptions modify this agent’s current ...
    • Boolean lexicographic optimization: algorithms & applications 

      Marques-Silva, Joao; Argelich Romà, Josep; Graça, Ana; Lynce, Inês (Springer Verlag, 2011)
      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 ...
    • Capturing Structure with Satisfiability 

      Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip; Gomes, Carla (Springer Verlag, 2001)
      We present Regular-SAT, an extension of Boolean Satisfiability basedon a class of many-valuedCNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT ...
    • Communication and Computation in Distributed CSP Algorithms 

      Fernàndez Camon, César; Béjar Torres, Ramón; Krishnamachari, Bhaskar; Gomes, Carla (Springer Verlag, 2005)
      We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP) ...
    • Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming 

      Chesñevar, Carlos Iván; Simari, Guillermo Ricardo; Godo i Lacasa, Lluís (Springer Verlag, 2005)
      Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty ...
    • Exact Max-SAT solvers for over-constrained problems 

      Argelich Romà, Josep; Manyà Serres, Felip (Springer Verlag, 2006)
      We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of ...
    • Exploiting multivalued knowledge in variable selection heuristics for SAT solvers 

      Ansótegui Gil, Carlos José; Larrubia, Jose; Li, Chu-Min; Manyà Serres, Felip (Springer Verlag, 2007)
      We show that we can design and implement extremely efficient variable selection heuristics for SAT solvers by identifying, in Boolean clause databases, sets of Boolean variables that model the same multivalued variable ...
    • Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers 

      Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)
      One of the main differences between complete SAT solvers and exact Max-SAT solvers is that the former make an intensive use of unit propagation at each node of the proof tree while the latter, in order to ensure optimality, ...
    • Extending the Reach of SAT with Many-Valued Logics 

      Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip; Gomes, Carla (Elsevier, 2001)
      We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNFform ulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT ...
    • Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT 

      Planes Cid, Jordi (Springer Verlag, 2003)
      We developed novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, which are variants of the algorithm of Borchers & Furman (BFA) [1]. We improved BFA by (i) defining a lower bound of better quality, ...
    • Improved Exact Solvers for Weighted Max-SAT 

      Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)
      We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality
    • Iterative and core-guided MaxSAT solving: A survey and assessment 

      Morgado, Antonio; Heras, Federico; Liffiton, Mark; Planes Cid, Jordi; Marques-Silva, Joao (Springer Verlag, 2013)
      Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real world applications can be naturally encoded as such. Solving MaxSAT is an important problem from both a theoretical and a practical point of ...
    • Knowledge Distribution in Large Organizations Using Defeasible Logic Programming 

      Chesñevar, Carlos Iván; Brena, Ramón F.; Aguirre, José Luis (Springer Verlag, 2005)
      Distributing pieces of knowledge in large, usually distributed organizations is a central problem in Knowledge and Organization Management. Policies for distributing knowledge and information are very often incomplete, ...
    • Minimal and Redundant SAT Encodings for the All-Interval-Series Problem 

      Alsinet, Teresa; Béjar Torres, Ramón; Cabiscol i Teixidó, Alba; Fernàndez Camon, César; Manyà Serres, Felip (Springer Verlag, 2002)
      The SAT encodings defined so far for the all-interval-series (ais) problem are very hard for local search but rather easy for systematic algorithms. We define different SAT encodings for the ais problem and provide ...