Search results

...reasoning]] and [[mathematical logic]] dealing with proving [[mathematical theorem]]s by [[computer program]]s. Automated reasoning over [[mathematical proof] ...of first-order formulas (and hence the [[Validity (logic)|validity]] of a theorem) to be reduced to (potentially infinitely many) propositional satisfiabilit ...

The two major paradigms for constructing semantic software systems were [[procedural programming|procedural]] and [[logic programming|logical] ...a proof by contradiction by adding the clausal form of the negation of the theorem to be proved.'' Using only resolution as the rule of inference is problemat ...

{{Short description|Mathematical software}} ...thematician]]s and [[scientist]]s. The development of the computer algebra systems in the second half of the 20th century is part of the discipline of "[[comp ...

{{short description|Computational software program}} {{Infobox software ...

...amming language]]s, [[cryptography]], [[automated theorem proving]], and [[software development]]. Conversely, computer implementations are significant in appl ...bility. [[Petri net]]s and [[process algebra]]s are used to model computer systems, and methods from discrete mathematics are used in analyzing [[VLSI]] elect ...

...owledge, in order to design [[Formal system|formalisms]] that make complex systems easier to design and build. KRR also incorporates findings from [[logic]] t ...oning]] engines include [[inference engine]]s, [[Automated theorem proving|theorem prover]]s, [[Boolean satisfiability problem|model generators]], and [[Stati ...

{{Infobox software | latest release version = {{Latest stable software release/Maple}} ...

...itation |last1=Lenat |first1=Douglas |title=Building Large Knowledge-Based Systems |pages=1–5 |year=1989 |publisher=Addison-Wesley |last2=Guha |first2=R. V. | ...ral language understanding]], [[automated reasoning]], [[automated theorem proving]], [[Formalism (philosophy of mathematics)|formalized]] [[logic]] [[expert ...

...bout the correspondence between truth and provability|Gödel's completeness theorem}} '''Gödel's incompleteness theorems''' are two [[theorem]]s of [[mathematical logic]] that are concerned with the limits of {{not a ...

| operating system = [[Cross-platform software|Cross-platform]]: [[Linux]], [[Unix]], [[macOS]], [[Microsoft Windows|Windo ...and [[formal methods]] software. Beyond these areas, it has found use in [[systems programming]], [[web development]], and specific financial utilities, among ...

...f theory]], such as the [[Löwenheim–Skolem theorem]] and the [[compactness theorem]]. ...scribe these two structures, i.e. [[categorical theory|categorical]] axiom systems, can be obtained in stronger logics such as [[second-order logic]]. ...

| subject = [[Complex systems]] ...ne]]s in 1 and 2 dimensions; several varieties of substitution and network systems; recursive functions; nested [[recursion (computer science)|recursive funct ...

...3-last=Zhang | editor3-first=Zili | title=Engineering Trustworthy Software Systems. SETSS 2018 | series=[[Lecture Notes in Computer Science]] | volume=11430 | ...Church–Turing thesis]]<br />[[Frege–Church ontology]]<br />[[Church–Rosser theorem]]<br />[[Intensional logic]] ...

...r-order function|Map (higher-order function)|the relation used in database systems to resolve many-to-many relationships|Associative entity}}. ...=Donald |chapter=A theory of finite maps |title=Higher Order Logic Theorem Proving and Its Applications |series=Lecture Notes in Computer Science |date=1995 | ...

...rst problem that was proven to be [[NP-complete]]—this is the [[Cook–Levin theorem]]. This means that all problems in the complexity class [[NP (complexity)|N ...99215|isbn=978-1-4244-7206-2|s2cid=7909084}}</ref> and [[automatic theorem proving]]. ...

{{Short description|Feature of systems that defy description}} ...s://web.archive.org/web/20220414202627/https://santafe.edu/what-is-complex-systems-science |url-status=dead }}</ref> ...

...lution of Russell's paradox is similar to approaches taken in other formal systems, such as [[Zermelo–Fraenkel set theory|Zermelo-Fraenkel set theory]].<ref n ...[[calculus of constructions]], which is used as the foundation by [[Rocq (software)|Rocq]] (previously known as ''Coq''), [[Lean (proof assistant)|Lean]], and ...

...ation=Englewood Cliffs/NJ | publisher=Prentice Hall | series=Prentice Hall Software Series | date=Apr 1988 |chapter=Appendix A}}</ref> for the [[C (programming ...tring homomorphism|homomorphism]]){{sfn|Hopcroft|Ullman|1979|p=131-132|loc=Theorem 6.2}} ...

...three symmetrically constructed points are [[collinear]]; here [[Menelaus' theorem]] gives a useful general criterion.{{sfn|Holme|2010|p=[https://books.google ...=[https://books.google.com/books?id=pc_kBwAAQBAJ&pg=PA128 128]}} [[Thales' theorem]] implies that if the circumcenter is located on the side of the triangle, ...

...//www.ijcai.org/Proceedings/69/Papers/023.pdf|title=Application of Theorem Proving to Problem Solving|conference=IJCAI 1969}}</ref> This used an axiomatizatio ...rst=Carl|last=Hewitt|author-link=Carl Hewitt|title=Planner: A Language for Proving Theorems in Robots|url=https://www.ijcai.org/Proceedings/69/Papers/030.pdf| ...