Disjunctive Datalog

Disjunctive Datalog is an extension of the logic programming language Datalog that allows disjunctions in the heads of rules. ^[1]

Ask AI

Table of Contents

1. 16 relations: ACM Transactions on Database Systems, Clique problem, Datalog, Disjunctive Datalog, Graph coloring, Logic programming, Logical disjunction, Maximal independent set, NP-completeness, NP-hardness, Ontology (information science), Polynomial hierarchy, Semantic Web, Stable model semantics, Syntax and semantics of logic programming, Travelling salesman problem.

2. Logic programming languages

ACM Transactions on Database Systems

The ACM Transactions on Database Systems (ACM TODS) is one of the journals produced by the Association for Computing Machinery.

See Disjunctive Datalog and ACM Transactions on Database Systems

Clique problem

In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph.

See Disjunctive Datalog and Clique problem

Datalog

Datalog is a declarative logic programming language. Disjunctive Datalog and Datalog are logic programming languages.

See Disjunctive Datalog and Datalog

Disjunctive Datalog

Disjunctive Datalog is an extension of the logic programming language Datalog that allows disjunctions in the heads of rules. Disjunctive Datalog and Disjunctive Datalog are logic programming languages.

See Disjunctive Datalog and Disjunctive Datalog

Graph coloring

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.

See Disjunctive Datalog and Graph coloring

Logic programming

Logic programming is a programming, database and knowledge representation paradigm based on formal logic.

See Disjunctive Datalog and Logic programming

Logical disjunction

In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction, is a logical connective typically notated as \lor and read aloud as "or".

See Disjunctive Datalog and Logical disjunction

Maximal independent set

In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set.

See Disjunctive Datalog and Maximal independent set

NP-completeness

In computational complexity theory, a problem is NP-complete when.

See Disjunctive Datalog and NP-completeness

NP-hardness

In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time, there is a polynomial-time reduction from L to H. That is, assuming a solution for H takes 1 unit time, Hs solution can be used to solve L in polynomial time.

See Disjunctive Datalog and NP-hardness

Ontology (information science)

In information science, an ontology encompasses a representation, formal naming, and definitions of the categories, properties, and relations between the concepts, data, or entities that pertain to one, many, or all domains of discourse.

See Disjunctive Datalog and Ontology (information science)

Polynomial hierarchy

In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes NP and co-NP.

See Disjunctive Datalog and Polynomial hierarchy

Semantic Web

The Semantic Web, sometimes known as Web 3.0 (not to be confused with Web3), is an extension of the World Wide Web through standards set by the World Wide Web Consortium (W3C).

See Disjunctive Datalog and Semantic Web

Stable model semantics

The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure.

See Disjunctive Datalog and Stable model semantics

Syntax and semantics of logic programming

Logic programming is a programming paradigm that includes languages based on formal logic, including Datalog and Prolog.

See Disjunctive Datalog and Syntax and semantics of logic programming

Travelling salesman problem

The travelling salesman problem, also known as the travelling salesperson problem (TSP), asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.

See Disjunctive Datalog and Travelling salesman problem

See also

Logic programming languages

• .QL
• Absys
• Alice (programming language)
• Alma-0
• CHIP (programming language)
• CycL
• Datalog
• Datomic
• Disjunctive Datalog
• ECLiPSe
• F-logic
• Flix (programming language)
• Flora-2
• Fril
• Gödel (programming language)
• Game Description Language
• HiLog
• Janus (concurrent constraint programming language)
• LogicBlox
• Maude system
• Oracle Intelligent Advisor
• Oz (programming language)
• Parlog
• Planner (programming language)
• ProbLog
• Prolog
• Prolog++
• Prolog32
• Prova
• ROOP (programming language)
• Soufflé (programming language)
• ToonTalk
• Transaction logic
• Twelf
• Vadalog

References

[1] https://en.wikipedia.org/wiki/Disjunctive_Datalog

Also known as DLV.

Unionpedia is a concept map or semantic network organized like an encyclopedia – dictionary. It gives a brief definition of each concept and its relationships.

This is a giant online mental map that serves as a basis for concept diagrams. It's free to use and each article or document can be downloaded. It's a tool, resource or reference for study, research, education, learning or teaching, that can be used by teachers, educators, pupils or students; for the academic world: for school, primary, secondary, high school, middle, technical degree, college, university, undergraduate, master's or doctoral degrees; for papers, reports, projects, ideas, documentation, surveys, summaries, or thesis. Here is the definition, explanation, description, or the meaning of each significant on which you need information, and a list of their associated concepts as a glossary. Available in English, Spanish, Portuguese, Japanese, Chinese, French, German, Italian, Polish, Dutch, Russian, Arabic, Hindi, Swedish, Ukrainian, Hungarian, Catalan, Czech, Hebrew, Danish, Finnish, Indonesian, Norwegian, Romanian, Turkish, Vietnamese, Korean, Thai, Greek, Bulgarian, Croatian, Slovak, Lithuanian, Filipino, Latvian, Estonian and Slovenian. More languages soon.

The information is based on Wikipedia articles and other Wikimedia projects, and it's available under the Creative Commons Attribution-ShareAlike License.

Unionpedia is not endorsed by or affiliated with the Wikimedia Foundation.

Google Play, Android and the Google Play logo are trademarks of Google Inc.

Privacy Policy