|
Semantics of Logic Programming: We study two semantics of
logic programs: the answer set semantics given by Gelfond and Lifschitz
(1991), and the completion semantics given by Clark (1978).These
two semantics are not equivalent for some logic programs, such as
the one containing the recursive definition of the transitive closure
of one of its predicates. We investigate under what conditions these
two semantics are equivalent so that we can use propositional solvers,
such as ccalc, instead of answer set solvers, such as dlv and smodels.
|
|
Applications of Answer Set Programming: The idea of naswer
set programming is to represent a given computational problem as
a logic program whose answer sets correspond to solutions, and to
use an answer set solver, such as dlv or smodels, to find an answer
set for this program. We investigate applications of answer set
programming to various fields, such as planning, graph theory and
wire routing.
|
