58 search results - page 9 / 12 » Weakly maximal decidable structures |
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
CP
1997
Springer
13 years 11 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
ENTCS
2007
13 years 7 months ago
2007
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Conventionally, most network protocols assume that the network entities who participate in the network activities will always behave as instructed. However, in practice, most n...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...