Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
fixpoints
Description:
Values unchanged by a function or operator, studied in mathematics, computer science, and formal semantics.
Primary topic:
Logic, programming, and type systems (40%)
Related topics:
Logic, programming, and type systems (40%),
Logic, Reasoning, and Knowledge (14%)
Wikidata ID:
wiki/Q217608
OpenAlex ID:
keywords/fixpoints
Introduction to Lattices and Order
2002
·
B. A. Davey
, H. A. Priestley
·
Cambridge University Press eBooks
·
5,625
The complexity of relational query languages (Extended Abstract)
1982
·
Moshe Y. Vardi
·
ACM Symposium on Theory of Computing (STOC)
·
1,718
Logic-Based Artificial Intelligence
2000
·
Denecker, Marc
, Marek, Victor
, et al.
·
Springer eBooks
·
289
PDF
Approximations, Stable Operators, Well-Founded Fixpoints and Applications in Nonmonotonic Reasoning
2000
·
Marc Denecker
, Victor Marek
, et al.
·
Springer eBooks
·
154
Lattice Theory for Rough Sets
2007
·
Jouni Järvinen
·
Springer eBooks
·
152
Approximating operators and semantics for abstract dialectical frameworks
2013
·
Hannes Strass
·
Artificial Intelligence
·
124
PDF
Uniform semantic treatment of default and autoepistemic logics
2003
·
Marc Denecker
, Victor W. Marek
, et al.
·
Artificial Intelligence
·
123
PDF
Ultimate approximation and its application in nonmonotonic knowledge representation systems
2004
·
Marc Denecker
, Victor W. Marek
, et al.
·
Information and Computation
·
112
Computing the Lattice of All Fixpoints of a Fuzzy Closure Operator
2010
·
Radim Belohlavek
, Bernard De Baets
, et al.
·
IEEE Transactions on Fuzzy Systems
·
106
Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
2011
·
Jan Outrata
, Vilem Vychodil
·
Information Sciences
·
100
Coalgebraic semantics of modal logics: An overview
2011
·
Clemens Kupke
, Dirk Pattinson
·
Theoretical Computer Science
·
92
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
2001
·
Marc Denecker
, Nikolay Pelov
, et al.
·
Lecture notes in computer science
·
81
A comparative study of logic programs with preference
2001
·
Torsten Schaub
, Kewen Wang
·
publish.UP (University of Potsdam)
·
79
Recursive definitions of partial functions and their computations
1972
·
J. M. Cadiou
, Zohar Manna
·
ACM SIGACT News
·
77
PDF
Semantics, conceptual spaces, and the meeting of minds
2011
·
Massimo Warglien
, Peter Gärdenfors
·
Synthese
·
75
Truth and Modality for Knowledge Representation
1990
·
Raymond Turner
·
75
From Symmetric Pattern-Matching to Quantum Control
2018
·
Amr Sabry
, Benoît Valiron
, et al.
·
Lecture notes in computer science
·
73
PDF
Regular Linear Temporal Logic
2007
·
Martin Leucker
, César Sánchez
·
Lecture notes in computer science
·
72
Free theorems in the presence of seq
2004
·
Patricia Johann
, Janis Voigtländer
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
71
A ‘Best-of-Breed’ approach for designing a fast algorithm for computing fixpoints of Galois Connections
2014
·
Simon Andrews
·
Information Sciences
·
69
PDF
Algebraic transformations of objective functions
1990
·
Eric Mjolsness
, Charles Garrett
·
Neural Networks
·
64
Proof-Theoretic Approach to Description-Logic
2006
·
M. Hofmann
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
59
On the Decidability of the Reachability Problem for Planar Differential Inclusions
2001
·
Eugene Asarin
, Gerardo Schneider
, et al.
·
Lecture notes in computer science
·
56
Semantics of logic programs with aggregates
2004
·
Nikolay Pelov
·
Lirias
·
55
PDF
The stabilization of environments
1995
·
Kristian J. Hammond
, Timothy M. Converse
, et al.
·
Artificial Intelligence
·
55
Show more works
View as search
Works count:
336
Citation count:
11,700
Year
Topic
Type