1020 search results - page 11 / 204 » Tight Semantics for Logic Programs |
AGP
2003
IEEE
14 years 25 days ago
2003
IEEE
CP
2005
Springer
13 years 9 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
PADL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
LPNMR
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
ASP
2003
Springer
14 years 23 days ago
2003
Springer
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. This is not quite so. This paper shows an...