Sciweavers

1549 search results - page 211 / 310
» On the rules of intermediate logics
Sort
View
IJDAR
2006
102views more  IJDAR 2006»
13 years 7 months ago
Table form document analysis based on the document structure grammar
Structure analysis of table form documents is an important issue because a printed document and even an electronic document do not provide logical structural information but merely...
Akira Amano, Naoki Asada, Masayuki Mukunoki, Masah...
JAPLL
2007
135views more  JAPLL 2007»
13 years 7 months ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
AIL
2000
78views more  AIL 2000»
13 years 7 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
WIOPT
2005
IEEE
14 years 1 months ago
A New Relaying Scheme for Cheap Wireless Relay Nodes
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
Ramin Khalili, Kavé Salamatian
LPNMR
2009
Springer
14 years 13 days ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran