6355 search results - page 384 / 1271 » From Logic to Games |
169
Voted
ICDT
2007
ACM
16 years 1 months ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
179
Voted
CSL
2005
Springer
16 years 12 days ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
161
Voted
ECAI
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. Defeasible logic (DL) promotes enthymemic, argumentative reasoning on incomplete set of premisses retracted on the presence of contrary information. Defeasible Prolog (d-...
140
Voted
ICAIL
2007
ACM
15 years 10 months ago
2007
ACM
This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for ...
148
click to vote
LOGCOM
2010
15 years 5 months ago
2010
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...