Each normal logic program has a 2-valued Minimal Hypotheses semantics

Edit and verify

Effective Capacity and Randomness of Closed Sets

Effective closed subshifts in 1D can be implemented in 2D

Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP

Effectively Open Real Functions

Efficient Description Logic Reasoning in Prolog: The DLog system

Efficient Emptiness Check for Timed Büchi Automata (Extended version)

Efficient First-Order Temporal Logic for Infinite-State Systems

Efficient Generation of Craig Interpolants in Satisfiability Modulo Theories

Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic

Efficient Solution of Language Equations Using Partitioned Representations

Efficient Solving of Quantified Inequality Constraints over the Real Numbers

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

Efficient Tabling Mechanisms for Transaction Logic Programs

Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo

Elgot Algebras

Eliciting implicit assumptions of proofs in the MIZAR Mathematical Library by property omission

Embedding Defeasible Logic into Logic Programming

Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination