Sciweavers

9532 search results - page 268 / 1907
» Logic, Graphs, and Algorithms
Sort
View
142
Voted
SAT
2007
Springer
146views Hardware» more  SAT 2007»
16 years 11 days ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
WLP
2004
Springer
15 years 11 months ago
Optimizing the Evaluation of XPath Using Description Logics
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...
JANCL
2002
113views more  JANCL 2002»
15 years 6 months ago
Canonicity and Completeness Results for Many-Valued Modal Logics
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a H...
Costas D. Koutras, Christos Nomikos, Pavlos Peppas
AI
2004
Springer
15 years 6 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
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...
Fangzhen Lin, Yuting Zhao