4:["$","div",null,{"className":"min-h-screen bg-white flex flex-col","children":[["$","div",null,{"className":"px-6 pt-6 pb-4 border-b border-gray-100","children":[["$","div",null,{"className":"flex items-center gap-1.5 text-xs text-gray-400 mb-4","children":[["$","a",null,{"href":"/","className":"hover:text-[#26a69a] transition-colors","children":"Market"}],["$","span",null,{"children":"›"}],["$","span",null,{"className":"text-gray-600","children":"Well-founded semantics"}]]}],["$","div",null,{"className":"text-[10px] text-gray-400 uppercase tracking-widest mb-1","children":"Company Profile"}],["$","h1",null,{"className":"text-2xl font-bold text-gray-900","children":"Well-founded semantics"}],null]}],["$","div",null,{"className":"flex-1 px-6 py-6","children":[["$","p",null,{"className":"text-sm text-gray-600 leading-relaxed mb-8","children":"In computer science, the well-founded semantics is a three-valued semantics for logic programming, which gives a precise meaning to general logic programs."}],["$","div",null,{"className":"columns-1 md:columns-2 gap-10","children":[["$","div","0",{"className":"mb-8 break-inside-avoid","children":[["$","div",null,{"className":"text-xs font-semibold text-gray-400 uppercase tracking-wide mb-3 border-b border-gray-100 pb-1","children":"History"}],["$","div",null,{"className":"text-sm text-gray-600 leading-relaxed wiki-content","dangerouslySetInnerHTML":{"__html":"The well-founded semantics was defined by Van Gelder, et al. in 1988. The Prolog system XSB implements the well-founded semantics since 1997. ==Three-valued logic=="}}]]}],["$","div","1",{"className":"mb-8 break-inside-avoid","children":[["$","div",null,{"className":"text-xs font-semibold text-gray-400 uppercase tracking-wide mb-3 border-b border-gray-100 pb-1","children":"Three-valued logic"}],["$","div",null,{"className":"text-sm text-gray-600 leading-relaxed wiki-content","dangerouslySetInnerHTML":{"__html":"The well-founded semantics assigns a unique model to every general logic program. However, instead of only assigning propositions true or false, it adds a third value unknown for representing ignorance. ==Complexity =="}}]]}],["$","div","2",{"className":"mb-8 break-inside-avoid","children":[["$","div",null,{"className":"text-xs font-semibold text-gray-400 uppercase tracking-wide mb-3 border-b border-gray-100 pb-1","children":"Complexity"}],["$","div",null,{"className":"text-sm text-gray-600 leading-relaxed wiki-content","dangerouslySetInnerHTML":{"__html":"In 1989, Van Gelder suggested an algorithm to compute the well-founded semantics of a propositional logic program whose time complexity is quadratic in the size of the program. , no general subquadratic algorithm for the problem was known. ==References=="}}]]}]]}],["$","div",null,{"className":"mt-8 pt-4 border-t border-gray-100","children":["$","a",null,{"href":"https://en.wikipedia.org/wiki/Well-founded%20semantics","target":"_blank","rel":"noopener noreferrer","className":"text-xs text-gray-400 hover:text-gray-600 transition-colors","children":"Source: Wikipedia ↗"}]}]]}],["$","div",null,{"className":"px-6 py-4 border-t border-gray-100 flex justify-between items-center","children":[["$","a",null,{"href":"/","className":"text-xs text-gray-300 italic hover:text-gray-500 transition-colors","children":"tickerdossier.com"}],["$","a",null,{"href":"https://tickerdossier.substack.com","target":"_blank","rel":"noopener noreferrer","className":"text-xs text-gray-400 hover:text-gray-600 transition-colors","children":"tickerdossier.substack.com"}]]}]]}]