Sciweavers

115 search results - page 7 / 23
» Decision Problems for Propositional Linear Logic
Sort
View
WG
1998
Springer
13 years 11 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
TARK
2007
Springer
14 years 1 months ago
Judgment aggregation and the problem of truth-tracking
The problem of the aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn m...
Gabriella Pigozzi, Stephan Hartmann
AIPS
2008
13 years 9 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
CCL
1994
Springer
13 years 11 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel
EUSFLAT
2009
170views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Decision Making in Competitive Location using Fuzzy Sets
This paper deals with the competitive location problems using fuzzy sets. The basic notions on fuzzy optimization and linear programming using fuzzy sets are briefly reviewed. The ...
Clara M. Campos, Lourdes Canós, Marí...