150 search results - page 18 / 30 » Complexity of the Unique Extension Problem in Default Logic |
ICALP
2009
Springer
15 years 4 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
136
click to vote
LPAR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
108
click to vote
ADC
2008
Springer
15 years 6 months ago
2008
Springer
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
101
Voted
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...