50 search results - page 8 / 10 » Strictly Level-Decreasing Logic Programs |
LOPSTR
1998
Springer
13 years 12 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
LICS
2002
IEEE
14 years 16 days ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
ESWS
2006
Springer
13 years 11 months ago
2006
Springer
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...