1486 search results - page 121 / 298 » A Logically Saturated Extension of |
158
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
155
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
174
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
192
click to vote
DEXAW
2003
IEEE
15 years 11 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
154
click to vote
FMCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...