3047 search results - page 114 / 610 » On the Meaning of Logical Completeness |
DALT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
LPNMR
1993
Springer
15 years 2 months ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
CADE
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
104
click to vote
CADE
2012
Springer
13 years 9 days ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
103
click to vote
EPIA
2009
Springer
15 years 4 months ago
2009
Springer
Logic Programming Update Languages were proposed as an extension of logic programming that allows modeling the dynamics of knowledge bases where both extensional (facts) and intent...