7167 search results - page 243 / 1434 » Answer Set Programming |
103
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness pr...
106
click to vote
DM
2006
15 years 2 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
121
click to vote
ARSCOM
2005
15 years 2 months ago
2005
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
104
click to vote
INFSOF
2000
15 years 2 months ago
2000
Semantic query optimization is the process of utilizing information implied by integrity constraints to reformulate the query into one that generates the same set of answers in a ...
JAT
2011
14 years 9 months ago
2011
We prove that there exists a weakly closed and bounded subset E of c0 which is not remotal from 0, and such that co (E) is remotal from 0. This answers a question of M. Mart´ın ...