Smodels
From MaRDI portal
Cited in
(only showing first 100 items - show all)- My work with Victor Marek: a mathematician looks at answer set programming
- Integrating answer set programming and constraint logic programming
- ASPeRiX
- GNT
- Classification of whist tournaments with up to 12 players
- PLATYPUS
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- GULP
- GraphBase
- HiLog
- N3Logic
- InstQL
- NP-SPEC
- LAILA
- DAML+OIL
- TRIPLE
- ASSAT
- LUPS
- HYPROLOG
- KARO
- PROD
- Expressing preferences in default logic
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- POEM
- Logic programming and knowledge representation---The A-Prolog perspective
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Extending and implementing the stable model semantics
- Punf
- DLV-Complex
- Cmodels
- PBS
- Gringo
- DASWAM
- Lparse
- DLV-EX
- What is answer set programming to propositional satisfiability
- DELORES
- ASPIDE
- CDAOstore
- Prolog
- wamcc
- SCR
- YAP-Prolog
- B-Prolog
- Potassco
- plasp
- NoMoRe
- clasp
- GASP
- Graphplan
- Logic programs with stable model semantics as a constraint programming paradigm
- Zinc
- Asparagus
- MYSTIQ
- WASP
- Galliwasp
- VIDEAS
- DMCS
- Clingcon
- Clingo
- CCalc
- Why-provenance information for RDF, rules, and negation
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- iClingo
- The dramatic true story of the frame default
- Using clausal deductive databases for defining semantics in disjunctive deductive databases
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results
- Arity and alternation: a proper hierarchy in higher order logics
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- Combining answer set programming with description logics for the semantic web
- Outlier detection using default reasoning
- Ciao
- CiaoPP
- A three-valued semantics for querying and repairing inconsistent databases
- Enhancing DLV instantiator by backjumping techniques
- Model checking multi-agent systems with logic based Petri nets
- Unfoldings: A partial-order approach to model checking.
- Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms
- SICStus
- OpenRuleBench
- Comparing action descriptions based on semantic preferences
- The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments
- ASPMT2SMT
- NP Datalog
- PolyFARM
- The refinement extension principle for semantics of dynamic logic programming
- Alan: An action language for modelling non-Markovian domains
- Answer sets and qualitative decision making
- ACORDA
- XASP
- XSB
- OPTYap
- swrl
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Declarative problem-solving using the DLV system
- Encoding domain and control knowledge for propositional planning
- Extending the Smodels system with cardinality and weight constraints
- Nonmonotonic reasoning: Towards efficient calculi and implementations
This page was built for software: Smodels
