725 search results - page 15 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
103
Voted
ENTCS
2008
15 years 2 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
114
click to vote
CLIMA
2007
15 years 3 months ago
2007
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
126
click to vote
EPIA
2005
Springer
15 years 8 months ago
2005
Springer
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
106
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
118
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...