Search results
Jump to navigation
Jump to search
Page title matches
- {{Short description|Formal semantics of logic programming languages}} ...Confusingly, the name "logic programming" also refers to a {{em|specific}} programming language that roughly corresponds to the declarative subset of Prolog. Unfo ...18 KB (2,700 words) - 11:07, 12 February 2024
Page text matches
- {{Short description|Constraint logic programming language}} ...hmetic in a logic programming language differs from other constraint logic programming ...3 KB (348 words) - 02:03, 22 April 2024
- ...= On disjunctions and existential statements in intuitionistic systems of logic | journal = [[Mathematische Annalen]] | volume = 132| issue = 4 | pages = 3 ...junction]] and [[existential quantification]] (except in the [[antecedent (logic)|antecedent]] of implication), [[Constructivism (mathematics)|non-construct ...4 KB (613 words) - 12:02, 1 September 2024
- ...s|Description Logic]], [[First-order logic|First-order Logic]] and [[Logic Programming]].<ref>J. de Bruijn, H. Lausen, A. Polleres, D. Fensel: The WSML rule langu ...tion of the [[Description Logics|Description Logic]] and [[Horn logic|Horn Logic]]. Supports modeling classes, attributes, binary relations and instances. ...3 KB (334 words) - 14:30, 17 August 2023
- ...}}</ref><ref>{{cite book |last1=Preining |first1=Norbert |title=Logic for Programming, Artificial Intelligence, and Reasoning |chapter=Gödel Logics – A Survey |s ...]] showed that infinite-valued [[propositional logic|propositional]] Gödel logic can be axiomatised by adding the [[axiom schema]] ...2 KB (316 words) - 14:25, 19 September 2024
- ...roceedings of the 17th International Colloquium on Automata, Languages and Programming | editor1-first = Michael S. | editor1-last = Paterson | publisher = [[Spri ...utation tree logic|computation tree logic (branching time logic)]]([[modal logic]]). So-called ''branching bisimulation'' has to be used.{{Citation needed|d ...2 KB (334 words) - 15:36, 24 January 2023
- ...obinson]] in 1965 and has become a fundamental notion in [[inductive logic programming]]. Deciding whether a given clause θ-subsumes another is an [[NP-completen ...[[Logical disjunction|disjunction]] of first-order [[Literal (mathematical logic)|literals]], can be considered as a set containing all its disjuncts. ...6 KB (780 words) - 09:47, 16 July 2024
- {{Short description|Probabilistic logic programming language}} | programming language = [[Python (programming language)|Python]] ...10 KB (1,327 words) - 09:11, 28 June 2024
- *[[Association for Logic Programming|ALP]] Test-of-Time Award (2018) ...asoning]], he is best known for his influential early work on [[answer set programming]] (ASP) ...6 KB (791 words) - 02:56, 8 May 2024
- ...ecification|book-title=Proceedings of the IFIP International Conference on Programming Concepts and Methods|volume=125|pages=148–166|publisher=Chapman & Hall|year ...|url=https://doi.org/10.1145/3591283|doi-access=free }}</ref> and [[Scala (programming language)|Scala]]. ...3 KB (436 words) - 15:01, 3 July 2024
- {{Short description|Knowledge representation computer programming language}} ...h inductive definitions |journal=International Conference on Computational Logic |date=2000 |pages=703–717 |doi= |arxiv=cs/0003019 |bibcode=2000cs........30 ...5 KB (577 words) - 08:44, 19 June 2024
- '''Disjunctive Datalog''' is an extension of the [[logic programming language]] [[Datalog]] that allows [[Logical disjunction|disjunctions]] in * [[Syntax and semantics of logic programming]] ...3 KB (427 words) - 05:32, 21 April 2024
- ...lgebra with tests: Completeness and decidability |journal=Computer Science Logic |date=September 1996b |volume=1258 |pages=244–259 |doi=10.1007/3-540-63172- ...Dexter Kozen |title=Kleene algebra with tests |journal=ACM Transactions on Programming Languages and Systems |date=May 1997 |volume=19 |issue=3 |pages=427–443 |do ...7 KB (874 words) - 19:18, 4 February 2025
- === Mathematical logic and computability theory === In [[mathematical logic]], such concepts as [[primitive recursive function]]s and [[μ-recursive fun ...4 KB (523 words) - 22:50, 8 October 2024
- ...as a foundation for logic programming|journal=[[Annals of Pure and Applied Logic]]|language=en|volume=51|issue=1|pages=125–157|doi=10.1016/0168-0072(91)9006 ...assical and intuitionistic variants of the [[modal logic]]s in the [[Modal logic|S5 cube]].<ref name=":0">{{Citation|last1=Chaudhuri|first1=Kaustuv|title=Fo ...8 KB (1,295 words) - 01:40, 29 July 2024
- ...t4=Andrei |date=2001-09-01 |title=Complexity and expressive power of logic programming |url=https://doi.org/10.1145/502807.502810 |journal=ACM Computing Surveys | The semantics of DatalogZ are based on [[Syntax and semantics of logic programming#Semantics|the model-theoretic (Herbrand) semantics of Datalog]].{{sfn|Kamin ...4 KB (612 words) - 08:01, 14 August 2023
- | programming language = [[C++]] ...extensional arrays, datatypes, uninterpreted functions, and [[quantifier (logic)|quantifier]]s. Its main applications are [[extended static checking]], tes ...6 KB (818 words) - 02:32, 21 January 2025
- {{Short description|Fragment of first-order logic}} ...-0684|quote=CHCs are syntactically and semantically the same as constraint logic programs|doi-access=free |arxiv=2108.00739 }}</ref> ...6 KB (795 words) - 22:58, 7 November 2024
- ...c]] due to [[Skolem]] that is [[proof-theoretic]]ally tractable. Geometric logic is capable of expressing many mathematical theories and has close connectio A theory of first-order logic is geometric if it is can be axiomatised using only axioms of the form ...4 KB (622 words) - 07:17, 4 June 2024
- {{Infobox programming language | influenced_by = [[Pascal (programming language)|Pascal]] ...3 KB (428 words) - 08:03, 12 February 2025
- ...cuted within its ''environment''. This knowledge is usually represented in logic-based [[action description language]] and used as the input for [[automated ...[[computational logic]]. As an example of a method based on propositional logic, we can mention SLAF (Simultaneous Learning and Filtering) algorithm,<ref n ...7 KB (968 words) - 15:22, 24 February 2025