About: Fixed-point logic

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematical logic, fixed-point logics are extensions of classical predicate logic that have been introduced to express recursion. Their development has been motivated by descriptive complexity theory and their relationship to database query languages, in particular to Datalog. Least fixed-point logic was first studied systematically by Yiannis N. Moschovakis in 1974, and it was introduced to computer scientists in 1979, when Alfred Aho and Jeffrey Ullman suggested fixed-point logic as an expressive database query language.

Property	Value
dbo:abstract	In mathematical logic, fixed-point logics are extensions of classical predicate logic that have been introduced to express recursion. Their development has been motivated by descriptive complexity theory and their relationship to database query languages, in particular to Datalog. Least fixed-point logic was first studied systematically by Yiannis N. Moschovakis in 1974, and it was introduced to computer scientists in 1979, when Alfred Aho and Jeffrey Ullman suggested fixed-point logic as an expressive database query language. (en)
dbo:wikiPageExternalLink	http://worldcat.org/oclc/901297152%7Ctitle=Descriptive
dbo:wikiPageID	50026488 (xsd:integer)
dbo:wikiPageLength	12540 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1100857522 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Descriptive_complexity_theory dbc:Database_theory dbr:Mathematical_logic dbr:Moshe_Vardi dbr:NL_(complexity) dbr:L_(complexity) dbr:Arity dbr:P_(complexity) dbr:Transitive_closure dbr:Alfred_Aho dbr:Datalog dbr:First-order_logic dbr:PSPACE dbc:Predicate_logic dbr:Jeffrey_Ullman dbr:AC_(complexity) dbr:Syntactic_sugar dbc:Descriptive_complexity dbr:Database_query_language dbr:Second-order_logic dbr:Yiannis_N._Moschovakis dbr:Neil_Immerman dbr:Signature_(logic)
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Mvar dbt:Reflist
dcterms:subject	dbc:Database_theory dbc:Predicate_logic dbc:Descriptive_complexity
rdfs:comment	In mathematical logic, fixed-point logics are extensions of classical predicate logic that have been introduced to express recursion. Their development has been motivated by descriptive complexity theory and their relationship to database query languages, in particular to Datalog. Least fixed-point logic was first studied systematically by Yiannis N. Moschovakis in 1974, and it was introduced to computer scientists in 1979, when Alfred Aho and Jeffrey Ullman suggested fixed-point logic as an expressive database query language. (en)
rdfs:label	Fixed-point logic (en)
owl:sameAs	wikidata:Fixed-point logic https://global.dbpedia.org/id/GQ2iz
prov:wasDerivedFrom	wikipedia-en:Fixed-point_logic?oldid=1100857522&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Fixed-point_logic
is dbo:wikiPageRedirects of	dbr:Fixed-Point_logic dbr:FO(LFP) dbr:Partial_fixed-point_logic dbr:Least_fixed-point_logic dbr:Fixpoint_logic
is dbo:wikiPageWikiLink of	dbr:Multimodal_logic dbr:Descriptive_complexity_theory dbr:Least_fixed_point dbr:Fixed-Point_logic dbr:FO(LFP) dbr:Modal_μ-calculus dbr:Extensions_of_First_Order_Logic dbr:Partial_fixed-point_logic dbr:S2S_(mathematics) dbr:Least_fixed-point_logic dbr:Fixpoint_logic
is foaf:primaryTopic of	wikipedia-en:Fixed-point_logic

This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License