Smodels

swMATH4631MaRDI QIDQ16801FDOQ16801

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Snapshot Generation in a Constructive Object-Oriented Modeling Language
• The refinement extension principle for semantics of dynamic logic programming
• Logic programming with infinite sets
• Title not available (Why is that?)
• A Framework for Reasoning with Rough Sets
• The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments
• Reasoning about the Intentions of Agents
• Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
• Automatic Composition of Melodic and Harmonic Music by Answer Set Programming
• Title not available (Why is that?)
• Layer Supported Models of Logic Programs
• Logic programs with abstract constraint atoms: the role of computations
• My work with Victor Marek: a mathematician looks at answer set programming
• Implementing constructive intensional negation
• Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
• The Impact of Treewidth on Grounding and Solving of Answer Set Programs
• Answer Set Programming: A Primer
• Title not available (Why is that?)
• Classification of whist tournaments with up to 12 players
• Title not available (Why is that?)
• Experimenting with recursive queries in database and logic programming systems
• Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
• Extending answer sets for logic programming agents
• Actions Over a Constructive Semantics for Description Logics
• Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
• Title not available (Why is that?)
• On methodology of representing knowledge in dynamic domains
• Logic Programming and Nonmonotonic Reasoning
• On the expressibility of stable logic programming
• Why-provenance information for RDF, rules, and negation
• Title not available (Why is that?)
• Optimization of bound disjunctive queries with constraints
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• cr-models: An Inference Engine for CR-Prolog
• Verification of bounded Petri nets using integer programming
• Moral Reasoning under Uncertainty
• Expressing Default Logic Variants in Default Logic
• What Is in a Step: New Perspectives on a Classical Question
• Enhancing DLV instantiator by backjumping techniques
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Title not available (Why is that?)
• Arity and alternation: a proper hierarchy in higher order logics
• Using clausal deductive databases for defining semantics in disjunctive deductive databases
• Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic programs with monotone abstract constraint atoms
• The Significance of Memory Costs in Answer Set Solver Implementation
• Planning with preferences using logic programming
• Computing abduction by using TMS with top-down expectation
• Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
• Weight constraint programs with evaluable functions
• Logic Programming and Nonmonotonic Reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• What is answer set programming to propositional satisfiability
• Title not available (Why is that?)
• Logic Programming
• Resolution for skeptical stable model semantics
• Enhancing disjunctive logic programming systems by SAT checkers
• Towards a general theory of topological maps
• A framework for compiling preferences in logic programs
• Strong Negation and Equivalence in the Safe Belief Semantics
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Search methods for tile sets in patterned DNA self-assembly
• Logics in Artificial Intelligence
• Ground Nonmonotonic Modal Logic S5: New Results
• Computing preferred answer sets by meta-interpretation in Answer Set Programming
• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Querying and Repairing Inconsistent Databases Under Three-Valued Semantics
• Outlier detection using default reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Twelve Definitions of a Stable Model
• Unfoldings: A partial-order approach to model checking.
• The limits of fixed-order computation
• Logic Programming and Nonmonotonic Reasoning
• Non-Markovian control in the Situation Calculus
• Unfolding partiality and disjunctions in stable model semantics
• Magic Sets and their application to data integration
• Model checking multi-agent systems with logic based Petri nets
• Bounded LTL model checking with stable models
• Computing weighted solutions in ASP: representation-based method vs. search-based method
• Title not available (Why is that?)
• InstQL: A Query Language for Virtual Institutions Using Answer Set Programming
• Answer sets and qualitative decision making
• Formalizing sensing actions -- a transition function based approach
• On abstract modular inference systems and solvers
• From answer set logic programming to circumscription via logic of GK
• Loop-separable programs and their first-order definability
• Answer set based design of knowledge systems

This page was built for software: Smodels