| Nome |
# |
|
Applying ASP to UML model validation, file dfa8b990-7acf-748b-e053-3a05fe0a3a96
|
615
|
|
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications, file dfa8b990-843b-748b-e053-3a05fe0a3a96
|
524
|
|
On the complexity of the disjunction property in intuitionistic and modal logics, file dfa8b990-7f65-748b-e053-3a05fe0a3a96
|
492
|
|
On maximal intermediate predicate constructive logics, file dfa8b98f-0383-748b-e053-3a05fe0a3a96
|
359
|
|
A proof-theoretical analysis of semiconstructive intermediate theories, file dfa8b990-7f6d-748b-e053-3a05fe0a3a96
|
339
|
|
A secondary semantics for second order intuitionistic propositional logic, file dfa8b990-808f-748b-e053-3a05fe0a3a96
|
328
|
|
fCube : an efficient prover for intuitionistic propositional logic, file dfa8b990-7c15-748b-e053-3a05fe0a3a96
|
327
|
|
A constructive object oriented modeling language for information systems, file dfa8b990-7c88-748b-e053-3a05fe0a3a96
|
315
|
|
A formal framework for synthesis and verification of logic programs, file dfa8b990-7e68-748b-e053-3a05fe0a3a96
|
288
|
|
Extracting information from intermediate semiconstructive HA-systems - extended abstract, file dfa8b98f-0bb8-748b-e053-3a05fe0a3a96
|
281
|
|
A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications, file dfa8b990-843c-748b-e053-3a05fe0a3a96
|
280
|
|
Simplification rules for intuitionistic propositional tableaux, file dfa8b990-8165-748b-e053-3a05fe0a3a96
|
269
|
|
Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models, file dfa8b990-a78a-748b-e053-3a05fe0a3a96
|
260
|
|
A space efficient implementation of a tableau calculus for a logic with a constructive negation, file dfa8b990-8092-748b-e053-3a05fe0a3a96
|
235
|
|
On the complexity of disjunction and explicit definability properties in some intermediate logics, file dfa8b990-877e-748b-e053-3a05fe0a3a96
|
231
|
|
Snapshot generation in a constructive object-oriented modeling language, file dfa8b990-7acc-748b-e053-3a05fe0a3a96
|
223
|
|
Extracting exact time bounds from logical proofs, file dfa8b990-809a-748b-e053-3a05fe0a3a96
|
221
|
|
Combining word problems through rewriting in categories with products, file dfa8b990-7f68-748b-e053-3a05fe0a3a96
|
211
|
|
Tableau calculi for the logics of finite k-ary trees, file dfa8b990-8807-748b-e053-3a05fe0a3a96
|
191
|
|
BCDL : Basic Constructive Description Logic, file dfa8b990-810d-748b-e053-3a05fe0a3a96
|
174
|
|
ESBC : an application for computing stabilization bounds, file dfa8b990-8097-748b-e053-3a05fe0a3a96
|
154
|
|
JTabWb : a Java framework for implementing terminating sequent and tableau calculi, file dfa8b991-2bd6-748b-e053-3a05fe0a3a96
|
140
|
|
All intermediate logics with extra axioms in one variable, except eight, are not strongly omega-complete, file dfa8b990-7e64-748b-e053-3a05fe0a3a96
|
132
|
|
Efficient SAT-based Proof Search in Intuitionistic Propositional Logic, file dfa8b9a7-964d-748b-e053-3a05fe0a3a96
|
130
|
|
Kripke completeness for intermediate logics, file dfa8b98f-ae54-748b-e053-3a05fe0a3a96
|
115
|
|
A constructive semantics for ALC, file dfa8b98f-2217-748b-e053-3a05fe0a3a96
|
93
|
|
Hypercanonicity, extensive canonicity, canonicity and strong completeness of intermediate propositional logics, file dfa8b990-7e65-748b-e053-3a05fe0a3a96
|
64
|
|
Snapshots generation via constructive logic, file dfa8b990-7f50-748b-e053-3a05fe0a3a96
|
64
|
|
Towards a type discipline for answer set programming, file dfa8b990-8158-748b-e053-3a05fe0a3a96
|
59
|
|
Reasoning on Information Term Semantics with ASP for Constructive ELꓕ, file dfa8b9a3-f297-748b-e053-3a05fe0a3a96
|
53
|
|
Focusing on contraction, file dfa8b990-e62c-748b-e053-3a05fe0a3a96
|
51
|
|
Connections Between Answer Set Semantics and Information Terms Semantics in Constructive EL_bot (Extended Abstract), file dfa8b9a3-f4ea-748b-e053-3a05fe0a3a96
|
49
|
|
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic, file dfa8b99f-4fa8-748b-e053-3a05fe0a3a96
|
46
|
|
Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic, file dfa8b9a4-b3ac-748b-e053-3a05fe0a3a96
|
41
|
|
A Natural Deduction Calculus for Godel-Dummett Logic Internalizing Proof-search Control Mechanisms, file dfa8b9a4-2985-748b-e053-3a05fe0a3a96
|
37
|
|
Model Validation through CooML Snapshot Generation, file dfa8b98f-5d18-748b-e053-3a05fe0a3a96
|
29
|
|
Forward refutation for Gödel-Dummett Logics, file dbb9a60c-2454-4180-a9e2-afae1e0298c1
|
23
|
|
Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations, file dfa8b993-23e5-748b-e053-3a05fe0a3a96
|
23
|
|
Proof-search in Hilbert calculi, file dfa8b999-b550-748b-e053-3a05fe0a3a96
|
21
|
|
SAT-Based Proof Search in Intermediate Propositional Logics, file b02cc27e-acfd-4595-b5cc-08e606b630d3
|
19
|
|
LOGI: A didactic tool for a beginners' course in logic (system description), file dfa8b999-b641-748b-e053-3a05fe0a3a96
|
17
|
|
Forward countermodel construction in modal Logic K, file dfa8b99c-3bd1-748b-e053-3a05fe0a3a96
|
15
|
|
A New Approach to Clausification for Intuitionistic Propositional Logic, file a5d87d33-6e6c-447e-b25f-f3a090d36367
|
13
|
|
A terminating evaluation-driven variant of G3i, file dfa8b990-c168-748b-e053-3a05fe0a3a96
|
6
|
|
An evaluation-driven decision procedure for G3i, file dfa8b992-14d2-748b-e053-3a05fe0a3a96
|
6
|
|
A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic, file dfa8b993-47e4-748b-e053-3a05fe0a3a96
|
5
|
|
Preface, file dfa8b998-c129-748b-e053-3a05fe0a3a96
|
5
|
|
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic, file dfa8b99d-2f99-748b-e053-3a05fe0a3a96
|
5
|
|
Terminating sequent calculi for proving and refuting formulas in S4, file dfa8b991-e372-748b-e053-3a05fe0a3a96
|
4
|
|
A decidable constructive description logic, file dfa8b996-a19e-748b-e053-3a05fe0a3a96
|
2
|
|
A constructive approach to testing model transformations, file dfa8b996-a553-748b-e053-3a05fe0a3a96
|
2
|
|
JTabWb : a Java framework for implementing terminating sequent and tableau calculi, file dfa8b998-5b21-748b-e053-3a05fe0a3a96
|
2
|
|
A Forward Unprovability Calculus for Intuitionistic Propositional Logic, file dfa8b999-56b3-748b-e053-3a05fe0a3a96
|
2
|
|
Special Issue on the 31Th Italian Conference on Computational Logic: CILC 2016, file dfa8b99b-4e9f-748b-e053-3a05fe0a3a96
|
2
|
|
Proof-Search in Natural Deduction Calculus for Classical Propositional Logic, file dfa8b993-287a-748b-e053-3a05fe0a3a96
|
1
|
|
From Constructivism to Logic Programming: an Homage to Mario Ornaghi, file dfa8b99b-86ae-748b-e053-3a05fe0a3a96
|
1
|
|
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic, file dfa8b9a1-5cfe-748b-e053-3a05fe0a3a96
|
1
|
|
A forward internal calculus for model generation in S4, file dfa8b9a6-9b2e-748b-e053-3a05fe0a3a96
|
1
|
| Totale |
7.596 |