The following pages link to Victor W. Marek (Q388663):
Displaying 50 items.
- Andrzej Mostowski, 1913--1975 (Q388664) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- Information systems: On queries involving cardinalities (Q598828) (← links)
- The complexity of recursive constraint satisfaction problems (Q636283) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Toward automating the discovery of decreasing measures (Q861690) (← links)
- (Q1029591) (redirect page) (← links)
- Set based logic programming (Q1029592) (← links)
- (Q1099630) (redirect page) (← links)
- Approximating sets with equivalence relations (Q1099631) (← links)
- A natural semantics for modal logic over databases (Q1102937) (← links)
- How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545) (← links)
- (Q1236881) (redirect page) (← links)
- Information storage and retrieval systems: Mathematical foundations (Q1236883) (← links)
- Bibliography of Andrzej Mostowski's works (Q1237712) (← links)
- Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
- A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
- A theory of nonmonotonic rule systems. II (Q1354038) (← links)
- A theory of nonmonotonic rule systems I (Q1356221) (← links)
- Modal logic for default reasoning (Q1356222) (← links)
- (Q1376094) (redirect page) (← links)
- Representation theory for default logic (Q1376095) (← links)
- Nonmonotonic rule systems with recursive sets of restraints (Q1389245) (← links)
- Revision programming (Q1389448) (← links)
- (Q1603738) (redirect page) (← links)
- Annotated revision programs (Q1603740) (← links)
- Computing with default logic (Q1606312) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- Satisfiability and computing van der Waerden numbers (Q1883655) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- Pairwise comparisons matrix decomposition into approximation and orthogonal component using Lie theory (Q2060797) (← links)
- Foundations of Mathematics in the Twentieth Century (Q2730841) (← links)
- (Q2734934) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- (Q2894723) (← links)
- Disjunctive Programs with Set Constraints (Q2900542) (← links)
- Effectively Reasoning about Infinite Sets in Answer Set Programming (Q3001917) (← links)
- (Q3050426) (← links)
- Guarded resolution for Answer Set Programming (Q3087811) (← links)
- (Q3194805) (← links)
- (Q3206922) (← links)
- (Q3206941) (← links)
- A Filter on $\lbrack \lambda \rbrack^$ (Q3320363) (← links)
- (Q3329456) (← links)
- On Some σ‐Algebras Containing the Projective Sets I (Q3333027) (← links)
- (Q3336746) (← links)
- Introduction to Mathematics of Satisfiability (Q3399426) (← links)
- On the complexity of index sets for finite predicate logic programs which allow function symbols (Q5108018) (← links)
