Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Gabbays_separation_theorem> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Gabbays_separation_theorem abstract "In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can be rewritten in a logically equivalent \"past → future\" form. I.e. the future becomes what must be satisfied. This form can be used as execution rules; a MetateM program is a set of such rules.".
- Gabbays_separation_theorem wikiPageID "19835615".
- Gabbays_separation_theorem wikiPageLength "1438".
- Gabbays_separation_theorem wikiPageOutDegree "9".
- Gabbays_separation_theorem wikiPageRevisionID "675446270".
- Gabbays_separation_theorem wikiPageWikiLink Category:Artificial_intelligence.
- Gabbays_separation_theorem wikiPageWikiLink Category:Modal_logic.
- Gabbays_separation_theorem wikiPageWikiLink Category:Theorems.
- Gabbays_separation_theorem wikiPageWikiLink Computer_science.
- Gabbays_separation_theorem wikiPageWikiLink Concurrent_MetateM.
- Gabbays_separation_theorem wikiPageWikiLink Dov_Gabbay.
- Gabbays_separation_theorem wikiPageWikiLink Logical_equivalence.
- Gabbays_separation_theorem wikiPageWikiLink Mathematical_logic.
- Gabbays_separation_theorem wikiPageWikiLink Temporal_logic.
- Gabbays_separation_theorem wikiPageWikiLinkText "Gabbay's separation theorem".
- Gabbays_separation_theorem wikiPageUsesTemplate Template:Comp-sci-stub.
- Gabbays_separation_theorem wikiPageUsesTemplate Template:Mathlogic-stub.
- Gabbays_separation_theorem wikiPageUsesTemplate Template:Reflist.
- Gabbays_separation_theorem subject Category:Artificial_intelligence.
- Gabbays_separation_theorem subject Category:Modal_logic.
- Gabbays_separation_theorem subject Category:Theorems.
- Gabbays_separation_theorem type Area.
- Gabbays_separation_theorem type Area.
- Gabbays_separation_theorem type Concept.
- Gabbays_separation_theorem type Theorem.
- Gabbays_separation_theorem comment "In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can be rewritten in a logically equivalent \"past → future\" form. I.e. the future becomes what must be satisfied. This form can be used as execution rules; a MetateM program is a set of such rules.".
- Gabbays_separation_theorem label "Gabbay's separation theorem".
- Gabbays_separation_theorem sameAs Q5515291.
- Gabbays_separation_theorem sameAs m.04q0qvh.
- Gabbays_separation_theorem sameAs Q5515291.
- Gabbays_separation_theorem wasDerivedFrom Gabbays_separation_theorem?oldid=675446270.
- Gabbays_separation_theorem isPrimaryTopicOf Gabbays_separation_theorem.