The DLV system for knowledge representation and reasoning
From MaRDI portal
Publication:5277755
Recommendations
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- Description logics in knowledge representation
- Efficient description logic reasoning in Prolog: The DLog system
- Declarative problem-solving using the DLV system
- scientific article; zbMATH DE number 1315582
- scientific article; zbMATH DE number 4112075
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- DL-learner: learning concepts in description logics
Cited in
(only showing first 100 items - show all)- Domain expansion for ASP-programs with external sources
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- Snapshot Generation in a Constructive Object-Oriented Modeling Language
- Declarative distributed computing
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- D-FLAT: declarative problem solving using tree decompositions and answer-set programming
- Combining event calculus and description logic reasoning via logic programming
- Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
- Disjunctive answer set solvers via templates
- Semantics and complexity of recursive aggregates in answer set programming
- Consistent query answering via ASP from different perspectives: theory and practice
- Computable Functions in ASP: Theory and Implementation
- Safe Formulas in the General Theory of Stable Models (Preliminary Report)
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Outlier detection using default reasoning
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- scientific article; zbMATH DE number 7121940 (Why is no real title available?)
- Logic programs with abstract constraint atoms: the role of computations
- Automata and Answer Set Programming
- Tractability frontiers of the partner units configuration problem
- The Design of the Sixth Answer Set Programming Competition
- John McCarthy's legacy
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
- Modern Datalog Engines
- Progress in clasp series 3
- Rewriting optimization statements in answer-set programs
- Reasoning with infinite stable models
- To Vladimir Lifschitz on His 65th Birthday
- Logic Programming and Nonmonotonic Reasoning
- Equilibrium logic
- Magic Sets and their application to data integration
- Answer Set Programming: A Primer
- Towards a Type Discipline for Answer Set Programming
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- Synonymous theories and knowledge representations in answer set programming
- On elementary loops of logic programs
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Stepwise debugging of answer-set programs
- scientific article; zbMATH DE number 1926616 (Why is no real title available?)
- Stable-unstable semantics: Beyond NP with normal logic programs
- Anytime computation of cautious consequences in answer set programming
- Improving the normalization of weight rules in answer set programs
- The dramatic true story of the frame default
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- From answer set logic programming to circumscription via logic of GK
- Loop-separable programs and their first-order definability
- Experimenting with recursive queries in database and logic programming systems
- A program-level approach to revising logic programs under the answer set semantics
- Better paracoherent answer sets with less resources
- Index sets for finite normal predicate logic programs with function symbols
- Normal Form Nested Programs
- The delay and window size problems in rule-based stream reasoning
- Abstraction for non-ground answer set programs
- Rough set reasoning using answer set programs
- LARS: a logic-based framework for analytic reasoning over streams
- Multi-level Algorithm Selection for ASP
- A first order nonmonotonic extension of constructive logic
- Disjunctive logic programs with existential quantification in rule heads
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Advances in WASP
- Automated reformulation of specifications by safe delay of constraints
- scientific article; zbMATH DE number 7453125 (Why is no real title available?)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
- OntoDLV: An ASP-based System for Enterprise Ontologies
- Finding explanations of inconsistency in multi-context systems
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- Reasoning about actions with Temporal Answer Sets
- On combining ontologies and rules
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Complex optimization in answer set programming
- Answer set programming based on propositional satisfiability
- Causes and explanations in the structural-model approach: Tractable cases
- Why-provenance information for RDF, rules, and negation
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Evaluating ASP and commercial solvers on the CSPLib
- Computing loops with at most one external support rule for disjunctive logic programs
- On the complexity of identifying head-elementary-set-free programs
- The Seventh Answer Set Programming Competition: Design and Results
- Logic programming
- A core language for fuzzy answer set programming
- Combining decidability paradigms for existential rules
- Answer set programming made easy
- scientific article; zbMATH DE number 1612542 (Why is no real title available?)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- Writing declarative specifications for clauses
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Team-building with answer set programming in the Gioia-Tauro seaport
- Aggregated fuzzy answer set programming
- FOLASP: FO(·) as Input Language for Answer Set Solvers
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Temporal logic programs with variables
- Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system
- Possibilistic uncertainty handling for answer set programming
- Exploiting functional dependencies in declarative problem specifications
- Combining answer set programming with description logics for the semantic web
- Equivalence between answer-set programs under (partially) fixed input
- Conflict-driven answer set solving: from theory to practice
This page was built for publication: The DLV system for knowledge representation and reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277755)
