W.B. Computer Terminology Guide

Feed Reader

Computer > Journal of Logic and Computation - Advance Access

Journal of Logic and Computation - RSS feed of articles

1.) Indifferent Sets

2.) Tableaux for Logics of Subinterval Structures over Dense Orderings

3.) A Note on Expressive Coalgebraic Logics for Finitary Set Functors

4.) Vietoris Bisimulations

5.) Quantale Modules and their Operators, with Applications

6.) Categorical Equivalences for Formula quasi-MV Algebras

7.) Rank-1 Modal Logics are Coalgebraic

8.) Algebras of Relations and Relevance Logic

9.) Editorial

10.) Deduction Systems for Coalgebras Over Measurable Spaces

11.) Constructive Logic with Strong Negation as a Substructural Logic

12.) The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation

13.) Differential-algebraic Dynamic Logic for Differential-algebraic Programs

14.) Applying Universal Algebra to Lambda Calculus

15.) Collaborative Runtime Verification with Tracematches

16.) Syllogistic Logics with Verbs

17.) Solutions to Some Open Problems on Totally Ordered Monoids

18.) Rule Systems for Run-time Monitoring: from EAGLE to RULER

19.) Paramodulation with well-founded orderings

20.) Rewriting Corner

21.) Tableaux for Public Announcement Logic

22.) A Non-finitary Sentential Logic that is Elementarily Algebraizable

23.) Reduced Implicate Tries with Updates

24.) Temporal Assertions with Parametrized Propositions

25.) A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4

26.) Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic

27.) Interaction-based Runtime Verification for Systems of Systems Integration

28.) Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

29.) Analytic Methods for the Logic of Proofs

30.) Finitely Presented MV-algebras with Finite Automorphism Group

31.) Bottom-up Construction of Semantic Tableaux

32.) Model Checking Using Description Logic

33.) Axiom Pinpointing in General Tableaux

34.) Nominal Algebra and the HSP Theorem

35.) A Multi-Agent System for Dynamic Ontologies

36.) Fixpoint and While Temporal Query Languages

37.) Enumeration Degrees and Enumerability of Familes

38.) Multimedia Interpretation for Dynamic Ontology Evolution

39.) Trust-based Revision for Expressive Web Syndication

40.) Undecidability in Some Structures Related to Computation Theory

41.) A Jump Inversion Theorem for the Degree Spectra

42.) Proof Complexity of the Cut-free Calculus of Structures

43.) Base Revision for Ontology Debugging

44.) The Significance of Memory Costs in Answer Set Solver Implementation

45.) The Uniformity Principle for {Sigma}-definability

46.) Category-based Equational Reasoning: An Approach to Ontology Integration

47.) Monotonic Answer Set Programming

48.) Infinite Computations and a Hierarchy in {Delta}3 Reconsidered

49.) Efficiently Querying RDF(S) Ontologies with Answer Set Programming

50.) Editorial

51.) Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic

52.) Reasoning Support for Mapping Revision

53.) OntoDLV: An ASP-based System for Enterprise Ontologies

54.) K-Triviality of Closed Sets and Continuous Functions

55.) A Translation-based Approach to the Verification of Modular Equivalence

56.) On Instance-level Update and Erasure in Description Logic Ontologies

57.) From (Quantified) Boolean Formulae to Answer Set Programming

58.) Borel Complexity of Topological Operations on Computable Metric Spaces

59.) Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures

60.) The Settling Time Reducibility Ordering and {Delta}Formula Sets

61.) Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping

62.) RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice

63.) Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays

64.) Pseudojumps and Formula Classes

65.) Non-manipulable social welfare functions when preferences are fuzzy

66.) A General Approach to Aggregation Problems

67.) Aggregating Judgements by Merging Evidence

68.) Aggregating Partially Ordered Preferences

69.) Geodesic Revision

70.) Call for Papers: Coalgebra & Logic




Powered by Odin Assemble 2.5a