725 search results - page 36 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
117
click to vote
TLCA
2009
Springer
15 years 9 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
147
click to vote
DALT
2005
Springer
15 years 8 months ago
2005
Springer
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...
144
Voted
TPLP
2002
15 years 2 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
134
click to vote
ICML
1989
IEEE
15 years 6 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
137
click to vote
LPNMR
2007
Springer
15 years 8 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...