2022 search results - page 56 / 405 » Complexity of Non-Monotonic Logics |
121
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
124
Voted
ENTCS
2006
15 years 19 days ago
2006
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
119
click to vote
CORR
2007
Springer
15 years 18 days ago
2007
Springer
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
112
Voted
AI
1999
Springer
15 years 9 days ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
103
click to vote
EPIA
2005
Springer
15 years 6 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...