20 search results - page 1 / 4 » Sets of Boolean Connectives That Make Argumentation Easier |
JELIA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
FOCS
1999
IEEE
13 years 8 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
AI
2010
Springer
13 years 4 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
GIS
2008
ACM
13 years 5 months ago
2008
ACM
The road network is one of the most important types of information on raster maps. In particular, the set of road intersection templates, which consists of the road intersection p...