Sciweavers

746 search results - page 51 / 150
» Connectionist Propositional Logic
Sort
View
CORR
2002
Springer
117views Education» more  CORR 2002»
14 years 10 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
PPDP
2009
Springer
15 years 4 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
LICS
2006
IEEE
15 years 4 months ago
Fixed-Parameter Hierarchies inside PSPACE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
Guoqiang Pan, Moshe Y. Vardi
BSL
2008
92views more  BSL 2008»
14 years 10 months ago
Mathematical Fuzzy Logics
The last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics. The paper discus...
Siegfried Gottwald
ICALP
2010
Springer
14 years 8 months ago
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
Angelo Montanari, Gabriele Puppis, Pietro Sala