2062 search results - page 104 / 413 » Derivatives of Logical Formulas |
115
click to vote
SOCO
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
190
click to vote
JELIA
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
103
click to vote
ATVA
2009
Springer
15 years 10 months ago
2009
Springer
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
111
click to vote
CSL
2004
Springer
15 years 9 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
134
click to vote
CP
2005
Springer
15 years 5 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...