The following pages link to (Q4052071):
Displaying 50 items.
- Querying incomplete information in RDF with SPARQL (Q286403) (← links)
- On methods for safe introduction of operations (Q293132) (← links)
- First-order logic formalisation of impossibility theorems in preference aggregation (Q373021) (← links)
- A logic road from special relativity to general relativity (Q383001) (← links)
- A scalable module system (Q391632) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Synonymous theories and knowledge representations in answer set programming (Q414849) (← links)
- On the verification of security-aware E-services (Q429592) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- The existence of superluminal particles is consistent with relativistic dynamics (Q472799) (← links)
- Minimal change: relevance and recovery revisited (Q490421) (← links)
- Game show shenanigans: Monty Hall meets mathematical logic (Q509122) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- A nonstandard characterization of sequential equilibrium, perfect equilibrium, and proper equilibrium (Q532649) (← links)
- Dealing with logical omniscience: expressiveness and pragmatics (Q543593) (← links)
- Free abelian lattice-ordered groups (Q556825) (← links)
- Some characterizations of finitely specifiable implicational dependency families (Q578937) (← links)
- A time bound on the materialization of some recursively defined views (Q578941) (← links)
- Partition semantics for relations (Q579957) (← links)
- Supersymmetry and the Möbius inversion function (Q583698) (← links)
- Reasoning about procedures as parameters in the language L4 (Q583874) (← links)
- A geometric interpretation of LD-resolution (Q596040) (← links)
- Duality and rationality (Q599666) (← links)
- On the proof-theory of two formalisations of modal first-order logic (Q622627) (← links)
- Partially-ordered (branching) generalized quantifiers: A general definition (Q676181) (← links)
- Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
- A decision algorithm for linear sentences on a PFM (Q685065) (← links)
- A logic for programming with complex objects (Q686642) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Linear quantifier elimination (Q707743) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Exaggeration (Q756609) (← links)
- An analysis of first-order logics of probability (Q757340) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- A logical study of the correspondence relation (Q797569) (← links)
- Correspondence as an intertheory relation (Q798642) (← links)
- Model complete universal Horn classes (Q800351) (← links)
- The logic and meaning of plurals. I (Q812095) (← links)
- Learning via finitely many queries (Q812396) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- Equivalence issues in abduction and induction (Q833733) (← links)
- Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules (Q833735) (← links)
- Well-founded semantics for Boolean grammars (Q840701) (← links)
