941 search results - page 180 / 189 » Mathematics on the (Semantic) NET |
OOPSLA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
COOPIS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
CAV
1999
Springer
15 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
ICLP
1992
Springer
15 years 1 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...