576 search results - page 10 / 116 » The Java Syntactic Extender |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
ACL
1990
13 years 9 months ago
1990
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
DALT
2005
Springer
14 years 2 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
ECSQARU
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
LICS
2002
IEEE
14 years 1 months 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...