Minimal logic programs ( extended report )

@inproceedings{Cabalar2007MinimalLP,
  title={Minimal logic programs ( extended report )},
  author={Pedro Cabalar and David Pearce and Agust́ın Valverde},
  year={2007}
}
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a method consisting in the generation of the set of prime implicates of the original theory, starting from its set of countermodels (in the logic of Here-and-There), in a similar vein to the Quine-McCluskey method for minimisation of boolean functions. As a side result, we also provide several results about fundamental… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…