The following pages link to Smodels (Q16801):
Displaying 50 items.
- On abstract modular inference systems and solvers (Q286083) (← links)
- A framework for modular ERDF ontologies (Q360258) (← links)
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Computing weighted solutions in ASP: representation-based method vs. search-based method (Q421455) (← links)
- A novel logic-based automatic approach to constructing compliant security policies (Q439715) (← links)
- Relating constraint answer set programming languages and algorithms (Q490456) (← links)
- Non-Markovian control in the Situation Calculus (Q543575) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- From answer set logic programming to circumscription via logic of GK (Q543597) (← links)
- Loop-separable programs and their first-order definability (Q543631) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- Extending answer sets for logic programming agents (Q702105) (← links)
- An approach from answer set programming to decision making in a railway interlocking system (Q740741) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Towards a general theory of topological maps (Q814534) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules (Q833735) (← links)
- Implementing constructive intensional negation (Q839831) (← links)
- Answer set based design of knowledge systems (Q854966) (← links)
- Possibilistic uncertainty handling for answer set programming (Q854974) (← links)
- Verification of bounded Petri nets using integer programming (Q878111) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Extended RDF: computability and complexity issues (Q905991) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- Integrating answer set programming and constraint logic programming (Q1028649) (← links)
- Classification of whist tournaments with up to 12 players (Q1406035) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Expressing preferences in default logic (Q1589465) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Logic programs with stable model semantics as a constraint programming paradigm (Q1978008) (← links)
- Why-provenance information for RDF, rules, and negation (Q2248547) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- The dramatic true story of the frame default (Q2341259) (← links)
- Using clausal deductive databases for defining semantics in disjunctive deductive databases (Q2349825) (← links)
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms (Q2353982) (← links)
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions (Q2353984) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- Arity and alternation: a proper hierarchy in higher order logics (Q2385450) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- Outlier detection using default reasoning (Q2389688) (← links)
- A three-valued semantics for querying and repairing inconsistent databases (Q2426103) (← links)
