The following pages link to Marcelo Finger (Q385020):
Displaying 50 items.
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic (Q596035) (← links)
- Application execution management on the integrade opportunistic grid middleware (Q666132) (← links)
- Cut and pay (Q851192) (← links)
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation (Q899162) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Adding a temporal dimension to a logic system (Q1314287) (← links)
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic (Q1799080) (← links)
- Combining temporal logic systems (Q1815427) (← links)
- Extending \(\mathcal{EL}^{++}\) with linear constraints on the probability of axioms (Q2185471) (← links)
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics (Q2209555) (← links)
- An efficient algorithm for representing piecewise linear functions into logic (Q2229157) (← links)
- Towards classifying propositional probabilistic logics (Q2250552) (← links)
- The universe of propositional approximations (Q2369011) (← links)
- Approximations of modal logics: \(\mathbf K\) and beyond (Q2478556) (← links)
- (Q2753192) (← links)
- (Q2762867) (← links)
- Towards automated first-order abduction: the cut-based approach (Q2909831) (← links)
- (Q3007263) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
- Analytic Methods for the Logic of Proofs (Q3406688) (← links)
- Anytime Approximations of Classical Logic from Above (Q3437258) (← links)
- Labelled natural deduction for substructural logics (Q4255972) (← links)
- Handling database updates in two-dimensional temporal logic (Q4275692) (← links)
- Parsing natural language using LDS: a prototype (Q4357321) (← links)
- Towards structurally-free theorem proving (Q4392659) (← links)
- (Q4430398) (← links)
- (Q4437965) (← links)
- (Q4440570) (← links)
- (Q4471863) (← links)
- A logical reconstruction of temporal databases (Q4528040) (← links)
- The Unrestricted Combination of Temporal Logic Systems (Q4545015) (← links)
- Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control (Q4820464) (← links)
- (Q4918401) (← links)
- The Universe of Approximations (Q4924531) (← links)
- Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics (Q4931585) (← links)
- (Q4946222) (← links)
- (Q4952322) (← links)
- (Q5100773) (← links)
- Towards an Efficient Prover for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> Paraconsistent Logic (Q5170293) (← links)
- Completeness for cut-based abduction (Q5176673) (← links)
- Using Abduction to Compute Efficient Proofs (Q5178959) (← links)
- (Q5226738) (← links)
- Advances in Artificial Intelligence – SBIA 2004 (Q5311203) (← links)
- Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (Q5326467) (← links)
- Logics in Artificial Intelligence (Q5394150) (← links)
- Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs (Q5436992) (← links)
- (Q5465437) (← links)
- Cut-Based Abduction (Q5504120) (← links)
- (Q5858678) (← links)
