scientific article; zbMATH DE number 25190
From MaRDI portal
Publication:3983043
Recommendations
Cited in
(only showing first 100 items - show all)- A new logical characterisation of stable models and answer sets
- A characterization of answer sets for logic programs
- Infinitary equilibrium logic and strongly equivalent logic programs
- Domain expansion for ASP-programs with external sources
- Semi-equilibrium models for paracoherent answer set programs
- Multi-context systems in dynamic environments
- P-log: refinement and a new coherency condition
- On the equivalence and range of applicability of graph-based representations of logic programs.
- Modeling biological networks by action languages via answer set programming
- Constraint answer set programming without grounding
- Generating explanations for biomedical queries
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Logic program proportions
- Determining action reversibility in STRIPS using answer set and epistemic logic programming
- A model building framework for answer set programming with external computations
- scientific article; zbMATH DE number 4009854 (Why is no real title available?)
- \texttt{eclingo}: a solver for epistemic logic programs
- An application of answer set programming to the field of second language acquisition
- scientific article; zbMATH DE number 859800 (Why is no real title available?)
- Matching dependencies: semantics and query answering
- LoCo—A Logic for Configuration Problems
- Assumption-based argumentation for extended disjunctive logic programming
- On deductive bases for paraconsistent answer set semantics
- On the relation between SPARQL1.1 and Answer Set Programming
- Querying disjunctive databases through nonmonotonic logics
- Combining event calculus and description logic reasoning via logic programming
- One More Decidable Class of Finitely Ground Programs
- Disjunctive answer set solvers via templates
- Parameterized splitting: a simple modification-based approach
- External sources of knowledge and value invention in logic programming
- Abduction from logic programs: Semantics and complexity
- Learning higher-order logic programs
- Model-based recasting in answer-set programming
- A note on the stable model semantics for logic programs
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
- Semantics and complexity of recursive aggregates in answer set programming
- LUPS -- A language for updating logic programs
- IASCAR: incremental answer set counting by anytime refinement
- Computable Functions in ASP: Theory and Implementation
- On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Outlier detection using default reasoning
- My work with Victor Marek: a mathematician looks at answer set programming
- Default Negation as Explicit Negation plus Update
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Probabilistic modelling, inference and learning using logical theories
- The Design of the Sixth Answer Set Programming Competition
- Possibilistic nested logic programs and strong equivalence
- John McCarthy's legacy
- Stable classes and operator pairs for disjunctive programs
- Reasoning with infinite stable models
- Toward Question Answering in Travel Domains
- scientific article; zbMATH DE number 591001 (Why is no real title available?)
- A selective semantics for logic programs with preferences
- An operational formal definition of PROLOG: A specification method and its application
- Equilibrium logic
- Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
- Magic Sets and their application to data integration
- Answer Set Programming: A Primer
- A non-ground realization of the stable and well-founded semantics
- Inconsistency measurement in \(\mathrm{LTL_f}\) based on minimal inconsistent sets and minimal correction sets
- Inductive equivalence in clausal logic and nonmonotonic logic programming
- Ordered completion for first-order logic programs on finite structures
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- Embedding circumscriptive theories in general disjunctive programs
- Stepwise debugging of answer-set programs
- Stable-unstable semantics: Beyond NP with normal logic programs
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- The dramatic true story of the frame default
- Inductive Negotiation in Answer Set Programming
- A QBF-based formalization of abstract argumentation semantics
- On abstract modular inference systems and solvers
- Evaluating epistemic negation in answer set programming
- Querying incomplete information in RDF with SPARQL
- An incremental algorithm for generating all minimal models
- From answer set logic programming to circumscription via logic of GK
- Answer set based design of knowledge systems
- An Algorithm for Computing Semi-stable Semantics
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Normal Form Nested Programs
- Characterizing and extending answer set semantics using possibility theory
- Dynamic reasoning systems
- General default logic
- Abstraction for non-ground answer set programs
- LARS: a logic-based framework for analytic reasoning over streams
- scientific article; zbMATH DE number 7455725 (Why is no real title available?)
- An ASP methodology for understanding narratives about stereotypical activities
- Translating LPOD and CR-\(\mathrm{Prolog}_2\) into standard answer set programs
- Probabilistic description logic programs
- Multi-level Algorithm Selection for ASP
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Ordering default theories and nonmonotonic logic programs
- Expressive power and complexity of partial models for disjunctive deductive databases
- Characterizations of the stable semantics by partial evaluation
- A first order nonmonotonic extension of constructive logic
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983043)
