Browsing by Subject "Propositional satisfiability"

Now showing items 1-5 of 5

    • Article  

      Classical methods in nonmonotonic reasoning 

      Dimopoulos, Yannis (1994)
      In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
    • Conference Object  

      Constraint propagation in propositional planning 

      Sideris, A.; Dimopoulos, Yannis (2010)
      Planning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization ...
    • Article  

      On computing logic programs 

      Dimopoulos, Yannis (1996)
      In this paper we present and compare some classical problem-solving methods for computing the stable models of logic programs with negation. Using a graph theoretic representation of logic programs and their stable models, ...
    • Article  

      Propositional planning as optimization 

      Sideris, A.; Dimopoulos, Yannis (2012)
      Planning as Satisfiability is a most successful approach to optimal propositional planning. Although optimality is highly desirable, for large problems it comes at a high, often prohibitive, computational cost. This paper ...
    • Article  

      Towards local search for answer sets 

      Dimopoulos, Yannis; Sideris, A. (2002)
      Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...