3047 search results - page 167 / 610 » On the Meaning of Logical Completeness |
101
Voted
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
107
click to vote
IJAR
2007
15 years 27 days ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
142
Voted
AI
2004
Springer
15 years 26 days ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
TARK
2007
Springer
15 years 7 months ago
2007
Springer
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
106
click to vote
LPNMR
2004
Springer
15 years 6 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...