177 search results - page 15 / 36 » Extending Conceptual Logic Programs with Arbitrary Rules |
JAPLL
2007
13 years 7 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
AGP
2003
IEEE
14 years 24 days ago
2003
IEEE
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. Evolving Logic Programs (EVOLP) has been recent...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
LPAR
2004
Springer
14 years 26 days ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...