2500 search results - page 14 / 500 » Logical Semantics of Modularisation |
156
click to vote
CALCO
2011
Springer
13 years 10 months ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
CP
2005
Springer
15 years 18 days 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...
IBERAMIA
2004
Springer
15 years 4 months ago
2004
Springer
Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models sema...
BIRTHDAY
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
120
click to vote
LPNMR
2001
Springer
15 years 3 months ago
2001
Springer
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...